#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, i, j;
int dp[10005][5005];
pair<int, int> v[5005];
int main()
{
    fin>>n>>g;
    for(i=1;i<=n;i++){
        fin>>v[i].first>>v[i].second;
    }

    for(i=1;i<=g;i++){
        for(j=1;j<=n;j++){
            if(v[j].first>i){
                dp[i][j]=dp[i][j-1];
            }else{
                dp[i][j]=max(dp[i][j-1], v[j].second+dp[i-v[j].first][j-1]);
            }
        }
    }

    fout<<dp[g][n];



    return 0;
}