#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int NMAX = 5001, GMAX = 10001;
int n, cost, w[NMAX], p[NMAX], dp[GMAX];

int main()
{
    fin >> n >> cost;
    for(int i = 1; i <= n; i++)
        fin >> w[i] >> p[i];
    for(int i = 1; i <= n; i++)
        for(int j = cost; j >= w[i]; j--)
            dp[j] = max(dp[j], dp[j - w[i]] + p[i]);
    fout << dp[cost];

    fin.close();
    fout.close();
    return 0;
}