#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,i,j,p[5010],w[5010],dp[2][10010],l;
int main()
{
    fin>>n>>g;
    for(i=1;i<=n;i++)
        fin>>w[i]>>p[i];
    for(i=1;i<=n;i++,l=1-l)
        for(j=1;j<=g;j++)
        {
            dp[1-l][j]=dp[l][j];
            if(w[i]<=j)
                dp[1-l][j]=max(dp[1-l][j],dp[l][j-w[i]]+p[i]);
        }
    fout<<dp[l][g];
    fin.close();
    fout.close();
    return 0;
}