#include<cstdio>
#include<algorithm>
using namespace std;
int v[5001], p[5001],dp[5001][10001],G,n;
void citire(){
    freopen("rucsac.in", "r", stdin);
    scanf("%d %d ", &n, &G);
    for(int i = 1; i <= n; ++i)
        scanf("%d %d", &v[i], &p[i]);
}
void solve(){
    int i=0,j=0,result=0;
    dp[0][0] = 0;
    for(i = 1; i <= n; ++i)
        for(j = v[i]; j <= G; ++j)
            dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - v[i]] + p[i]);
    for(i = 1; i <= G; ++i)result = max(result, dp[n][i]);
    printf("%d\n", result);
}
int main(){
    freopen("rucsac.out", "w", stdout);
    citire();
    solve();
}