#include <fstream>

using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int n, g, dp[5005][10005], p[5010], w[5010];

int maxim (int a, int b) {
    if (a > b)
        return a;
    else
        return b;
}

int main()
{
    int i, j;
    fin >> n >> g;
    for (i = 1; i <= n; i++) {
        fin >> w[i] >> p[i];
        for (j = 1; j <= g; j++) {
            if (j - w[i] >= 0)
                dp[i][j] = maxim( dp[i-1][j], dp[i-1][ j - w[i] ] + p[i]);
            else
                dp[i][j] = dp[i-1][j];
        }
    }
    fout << dp[n][g];
    return 0;
}