#include <cstdio>
#include <algorithm>

using namespace std;

int s,n;

int dp[10005], w[5005], p[5005];

int main() {
    freopen("rucsac.in", "r", stdin);
    freopen("rucsac.out", "w", stdout);
    int i,j;
    scanf("%d%d", &n, &s);
    for(i = 1; i <= n; ++i) {
        scanf("%d%d", &w[i], &p[i]);
    }
    for(i = 1; i <= n; ++i) {
        for(j = s; j >= 1; --j) {
            if (w[i] <= j )
            dp[j] = max(dp[j], dp[j - w[i]] +p[i]);
        }
    }
    printf("%d", dp[s]);
    return 0;
}