#include <bits/stdc++.h>
#define N 5005
#define G 10005

using namespace std;

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

int n, dp[2][G], g, P[N], W[N];

int main()
{
    fin >> n >> g;
    for (int i = 1; i <= n; i++)
        fin >> W[i] >> P[i];
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= g; j++)
        {
            if (j >= W[i])
                dp[1][j] = max(dp[0][j], dp[0][j - W[i]] + P[i]);
            else dp[1][j] = dp[0][j];
        }

        for (int j = 1; j <= g; j++)
            dp[0][j] = dp[1][j];
    }
    fout << dp[0][g];
    return 0;
}