#include <fstream>
#include <algorithm>
using namespace std;
int dp[105][105], g[105], c[105];
int G, n, i, j, sol;
int main()
{
    ifstream fin("rucsac.in");
    ofstream fout("rucsac.out");
    fin >> n >> G;
    for(i = 1; i <= n; i ++)
     fin >> g[i] >> c[i];
    for(i = 1; i <= n; i ++)
        for(j = 0; j <= G; j ++)
        {
            dp[i][j] = dp[i - 1][j];
            if(g[i] <= j)
                dp[i][j] = max(dp[i][j], dp[i - 1][j - g[i]] + c[i]);
        }
   sol = dp[n][G];
   fout << sol;
   return 0;
}