#include <iostream>
#include <algorithm>
using namespace std;
const int N = 110;
int v[N][N],w[N][N],s[N];
int n,vol;
int dp[N];
int main(){
    cin>>n>>vol;
    for(int i = 1;i<=n;i++){
        cin>>s[i];
        for(int j = 0;j<s[i];j++)
           cin>>v[i][j]>>w[i][j];
    }

    for(int i = 1;i<=n;i++)
       for(int j = vol;j>=0;j--)
          for(int k = 0;k<s[i];k++){
              if(v[i][k]<=j)
              dp[j] = max(dp[j],dp[j-v[i][k]]+w[i][k]);
          }

    cout<<dp[vol]<<endl;

}