#include <bits/stdc++.h>
#define nmax 10005

using namespace std;

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

int dp[nmax / 2][nmax], n, g, gr[nmax], p[nmax];

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