#include <stdio.h>
#include <algorithm>
#include <vector>
#include <string.h>

using namespace std;

const int G = 10010;
const int N = 5050;

int p[N], w[N];
int dp[G];

int main() {
    freopen("rucsac.in", "r", stdin);
    freopen("rucsac.out", "w", stdout);
    int n, g;
    scanf("%d%d", &n, &g);
    for(int i = 1; i <= n; i++) {
        scanf("%d%d", &w[i], &p[i]);
    }
    memset(dp, -1, sizeof(dp)/sizeof(int));
    dp[0] = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = g - w[i]; j >= 0; j--) {
            if(dp[j + w[i]] < dp[j] + p[i] && dp[j] != -1) dp[j + w[i]] = dp[j] + p[i];
        }
    }
    printf("%d\n", *max_element(dp, dp + g + 1));
}