#include <bits/stdc++.h>

using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n,g,p[5005],w[5005],d[10005],ans;
int main()
{
    in>>n>>g;
    for(int i=1;i<=n;i++) in>>w[i]>>p[i];

    for(int i=1;i<=n;i++)
      for(int j=g;j-w[i]>=0;j--)
      {
          d[j]=max(d[j],d[j-w[i]]+p[i]);
          ans=max(ans,d[j]);
      }

    out<<ans;
    return 0;
}