#include<fstream>
using namespace std;

ifstream cin ("rucsac.in");
ofstream cout ("rucsac.out");

int dp[5001][10001], n, g, p[5001], w[10001];
int maxx;
int main()
{
    cin >> n >> g;
    for(int i = 1; i <= n; i++)
        cin >> p[i] >> w[i];
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= g; j++)
        {
            if(j >= w[i])    
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w[i]] + p[i]);
            else
                dp[i][j] = dp[i - 1][j];
    }
    for(int i = 1; i <= g; i++)
        if(dp[n][i] > maxx)
            maxx = dp[n][i];

    cout << maxx;
    return 0;

}