#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, i, j, w[5005], p[5005], dp[2][10005], rez;
int main()
{
    fin>>n>>g;
    for(i=1; i<=n; ++i)
        fin>>w[i]>>p[i];
    for(i=1; i<=n; ++i)
        for(j=1; j<=g; ++j){
            dp[i%2][j]=dp[1-i%2][j];
            if(j>=w[i]){
                dp[i%2][j]=max(dp[i%2][j], dp[1-i%2][j-w[i]]+p[i]);
            }
        }
    for(i=1; i<=g; ++i)
        rez=max(rez, dp[n%2][i]);
    fout<<rez;
    return 0;
}