#include <iostream>
#include <fstream>

using namespace std;

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

int n, g;
int a[5003][10004];
int p[5003];
int w[5003];

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

    for(int i = 0; i <= n+1; i++)
        for(int j = 1; j <= g+1; j++)
            a[i][j] = -1;
    a[0][0] = 0;
    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(w[i] > j)
            {
                a[i][j] = a[i-1][j];
                continue;
            }
            a[i][j] = max(a[i-1][j], a[i-1][j-w[i]] + p[i]);
        }
    }
    int mx = 0;
    for(int i = 1; i <= g; i++)
        mx = max(mx, a[n][i]);
    fout << mx;
    return 0;
}