#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>

using namespace std;

int main()
{
    ifstream fin("rucsac.in");
    ofstream fout("rucsac.out");

    int N, G;
    fin >> N >> G;

    vector<vector<int>> dp(N + 1, vector<int>(G + 1, 0));

    for (int i = 1; i <= N; i++)
    {
        int w, p;
        fin >> w >> p;
        for (int j = 0; j <= G; j++)
        {
            if (w > j)
                dp[i][j] = dp[i - 1][j];
            else
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + p);
        }
    }

    fout << dp[N][G];
    return 0;
}