#include<bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,ans;
vector<int>weight,profit;
vector<vector<int>>dp;
int main()
{
    f>>n>>G;
    dp.assign(n+1,vector<int>(G+1,0));
    weight.resize(n+1);
    profit.resize(n+1);
    for(int i=1;i<=n;i++)
        f>>weight[i]>>profit[i];
    for(int i=1; i<=n; i++)
        for(int j=weight[i]; j<=G; j++)
            dp[i][j]=max(dp[i-1][j],dp[i-1][j-weight[i]]+profit[i]);
    for(int i=1; i<=G; i++)
        ans=max(ans,dp[n][i]);
    g<<ans;
    return 0;
}