#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

const int MAXN = 5010;
const int MAXG = 10010;
int DP[MAXN][MAXG];
int w[MAXN];
int p[MAXN];
int main() {
    ifstream f("rucsac.in");
    int n, G;
    f >> n >> G;
    for (int i = 1 ;i <= n; i++)
    {
        f >> w[i] >> p[i];
    }
    for(int i = 1; i<= n; i++)
    {
        for(int j = 0; j <= G; j++)
        {
            if (j - w[i] >= 0 && DP[i-1][j] < DP[i-1][j-w[i]] + p[i])
            {
                DP[i][j] = DP[i-1][j-w[i]] + p[i];
            }
            else
                DP[i][j] = DP[i-1][j];
        }
    }
    int x = DP[n][G];
    cout << x;
    return 0;
}