#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
const int nmax=1e5+2;
int d[10001][10001],n,gr;
int p[nmax],w[nmax];
int main()
{
    f >> n >> gr;
    for(int i=1; i<=n; i++)
    {
        f >> w[i] >> p[i];
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=gr;j++)
        {
            d[i][j]=d[i-1][j];
            if(w[i]<=j)
                d[i][j]=max(d[i][j],d[i-1][j-w[i]]+p[i]);
        }
    }
    g<<d[n][gr];
    return 0;
}