#include <bits/stdc++.h>

using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G,a[5001],b[5001],j,i,dp[5001][5001];
int main()
{
    fin>>n>>G;
    for(i=1;i<=n;i++)
        fin>>a[i]>>b[i];

    for(i=1;i<=n;i++)
        for(j=1;j<=G;j++)
    {
        if( j>=a[i])
            dp[i][j]=max(dp[i-1][j] , dp[i-1][j-a[i]]+b[i]);
            else
            dp[i][j] = dp[i-1][j-1];
    }

    fout<<dp[n][G];
    return 0;
}