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

int main(void) {
    int n, g, w[5001], p[5001];
    ifstream fin("rucsac.in");
    ofstream fout("rucsac.out");
    fin>>n>>g;
    for (int i=1; i<=n; i++)
        fin>>w[i]>>p[i];
    vector<vector<int>> dp(n+1, vector<int>(g+1, 0));//dp[i][j] = profitul maxim prin luarea a primele i el cu greutatea max j
    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];
    fout<<dp[n][g];
    fin.close();
    fout.close();
    return 0;
}