#include <bits/stdc++.h>

using namespace std;

ifstream in ("rucsac.in");
ofstream out ("rucsac.out");

int dp[10][10008];
int gr[1001],val[1001];


int main()
{
    int n,g;
    in >> n >> g;
    for (int i=1; i<=n; i++) {
        in >> gr[i] >> val[i];
    }
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=g; j++) {
            if (gr[i]>j) {
                dp[2][j]=dp[1][j];
            } else {
                dp[2][j]=max(dp[1][j],dp[1][j-gr[i]]+val[i]);
            }
        }
        for (int j=0; j<=g; j++) { ///le ducem la stanga ca sa facem loc
            dp[1][j]=dp[2][j];
        }
    }
    out << dp[2][g];
    return 0;
}