#include<bits/stdc++.h>

#define s first

#define e second

#define rep(i,a,b) for(int i=a;i<=b;i++)

#define rep2(i,a,b) for(int i=a;i>=b;i--)

#define ll long long

using namespace std;

const int maxn=;

const int inf=1e9;

int dp[maxn],tmp[maxn],c[maxn],g[maxn],T,M;

void solve0() //at least

{

    rep(i,,T) tmp[i]=-inf;

    rep(i,,M)

      rep2(j,T,c[i]){

        tmp[j]=max(tmp[j],max(dp[j-c[i]]+g[i],tmp[j-c[i]]+g[i]));

    }

    rep(i,,T) dp[i]=tmp[i];

}

void solve1() //at most

{

    rep(i,,T) tmp[i]=dp[i];

    rep(i,,M)

      rep2(j,T,c[i])

        dp[j]=max(tmp[j-c[i]]+g[i],dp[j]);

}

void solve2() //free

{

    rep(i,,M)

      rep2(j,T,c[i])

        dp[j]=max(dp[j-c[i]]+g[i],dp[j]);

}

int main()

{

    int N,S,ans;

    while(~scanf("%d%d",&N,&T)){

        memset(dp,,sizeof(dp));

        ans=-;

        rep(i,,N){

            scanf("%d%d",&M,&S);

            rep(j,,M) scanf("%d%d",&c[j],&g[j]);

            if(S==) solve0();

            if(S==) solve1();

            if(S==) solve2();

        }

        ans=max(ans,dp[T]);

        printf("%d\n",ans);

    }

    return ;

}