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

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

int n, g, w[N], p[N], dp[5001][N];

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