#include <fstream>

using namespace std;

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

const int NMAX = 5000;
const int GMAX = 1e4;
int dp[GMAX + 5], G[NMAX + 5], p[NMAX + 5];

int main()
{
    int n, g;
    fin >> n >> g;

    for(int i = 1; i <= n; i++)
        fin >> G[i] >> p[i];

    for(int i = 1; i <= g; i++)
        dp[i] = -1;

    for(int i = 1; i <= n; i++)
        for(int j = g; j >= 0; j--)
            if(j - G[i] >= 0 and dp[j - G[i]] != -1)
                dp[j] = max(dp[j - G[i]] + p[i], dp[j]);

    int ans = 0;
    for(int i = 1; i <= g; i++)
        ans = max(ans, dp[i]);

    fout << ans;

    fin.close();
    fout.close();
    return 0;
}