#include <bits/stdc++.h>

using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,gm,d[5005][10005],w[5005],p[5005];
int main()
{
    in>>n>>gm;
    for(int i=1;i<=n;i++)
        in>>w[i]>>p[i];
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<=gm;j++)
        {
            if(j-w[i]>=0) d[i][j]=max(d[i-1][j],d[i-1][j-w[i]]+p[i]);
            else d[i][j]=d[i-1][j];
        }
    }
    out<<d[n][gm];
    return 0;
}