#include <bits/stdc++.h>

using namespace std;

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

int n, G;
int v[5005], g[5005];
int dp[5005][5005];


int main()
{
    fin >> n >> G;
    for(int i = 1; i <= n; i++)
        fin >> g[i] >> v[i];

    dp[1][g[1]] = v[1];
    for(int i = 2; i <= n; i++)
        for(int j = 1; j <= G; j++)
        {
            dp[i][j] = dp[i - 1][j];
            if(j >= g[i])
                dp[i][j] = max(dp[i][j],
                                v[i] + dp[i-1][j - g[i]]);
        }


    fout << dp[n][G];
    return 0;
}