#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int N = 1e5;
int n,g;
int w[N], v[N], dp[N][N];
void citire(){
    fin >> n >> g;
    for(int i = 1; i<=n; i++){
        fin >> w[i] >> v[i];
    }
}
void solve(){
    for(int s = 1; s<=g; s++){
        for(int i = 1; i<=n; i++){
            if(w[i] > s) dp[i][s] = dp[i-1][s];
            else{
                dp[i][s] = max(dp[i-1][s], v[i] + dp[i-1][s-w[i]]);
            }
        }
    }
}
int main(){
    citire();
    solve();
    fout << dp[n][g] << '\n';

    return 0;
}