#include <bits/stdc++.h>

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

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

    vector<int> w(n + 1), p(n + 1), dp(g + 1);

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

    int maxim = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = g - w[i]; j >= 0; j--)
        {
            dp[j + w[i]] = max(dp[j + w[i]], dp[j] + p[i]);
            maxim = max(maxim, dp[j + w[i]]);
        }
    }

    fout << maxim;
    return 0;
}