#include <iostream>
#include <cstring>
#include <fstream>
#define MAX 10002
using namespace std;
int n,g,w,p,dp[MAX],ans;

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

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