#include <bits/stdc++.h>
using namespace std;

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

int n, g, w, p;
int dp[10001];

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

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

    fout << dp[g];
    return 0;
}