#include <iostream>

using namespace std;
int G,i,n,w[5005],p[5005],dp[2][5005],cw,maxi;
int main()
{
    cin >> n >> G;
    for(i = 1;i<=n;i++){
        cin >> w[i] >> p[i];
    }
    for(i = 1;i<=n;i++){
        for(cw = 1;cw<=G;cw++){
            dp[i%2][cw]=dp[1-i%2][cw];
            if(w[i]<=cw){
                dp[i%2][cw]=max(dp[i%2][cw],dp[1-i%2][cw-w[i]]+p[i]);
            }
        }
    }
    for(i = 1;i<=G;i++){
        if(maxi<dp[n%2][i]){
            maxi = dp[n%2][i];
        }
    }
    cout << maxi;
    return 0;
}