#include <cstdio>
using namespace std;

int N, G, i, ans, w, p;
int dp[10001];

inline int max(int a, int b)
{
    if (a > b)
        return a;
    return b;
}

int main()
{
    freopen("rucsac.in", "r", stdin);
    freopen("rucsac.out", "w", stdout);

    scanf("%d %d", &N, &G);
    for ( ; N ; --N){
        scanf("%d %d", &w, &p);

        for (i = G - w; i >= 0; --i)
            dp[i+w] = max(dp[i+w], dp[i] + p);
    }
    for (i = 0; i <= G; ++i)
        ans = max(ans, dp[i]);
    printf("%d\n", ans);

    return 0;
}