#include <fstream>
	
using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
	
int n, g;	
int p[5005], w[5005];
int dp[1005][1005];
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=1; j<=g; j++)
        	if(j >= w[i])
            	dp[i][j]=max(p[i]+dp[i-1][j-w[i]],dp[i-1][j]);
            else dp[i][j] = dp[i - 1][j];
	
    fout<<dp[n][g];
	
    return 0;
	
}