#include <iostream>
#include <fstream>
using namespace std;
int g, n, greutate[10001], profit[10001];
int main()
{
    ifstream fin("rucsac.in");
    ofstream fout("rucsac.out");
    fin >> n >> g;
    for (int i = 1; i <= n; i++)
    {
        fin >> greutate[i] >> profit[i];
    }
    int dp[n + 1][g + 1];
    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= g; j++)
        {
            if (i == 0 || j == 0)
                dp[i][j] = 0;
            else
            {
          // dp[i][j] = dp[i - 1][j];
              if (greutate[i] <= j)
                 dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - greutate[i]] + profit[i]);
              else
                 dp[i][j] = dp[i - 1][j];
            }
        }
    fout << dp[n][g];
    fin.close();
    fout.close();
    return 0;
}