#include <bits/stdc++.h>

using namespace std;

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

int n, g, w[5001], v[5001], dp[10001];

void read(){
    fin >> n >> g;
    for(int i = 1; i <= n; i++)
        fin >> w[i] >> v[i];
}

void solve(){
    for(int i = 1; i <= n; i++)
        for(int j = g; j >= w[i]; j--)
            dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
    fout << dp[g];
}

int main()
{
    read();
    solve();
    return 0;
}