#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int gmax = 10005;

int n, g, w, p, i, best, dp[gmax];

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

    scanf("%d%d", &n, &g);

    for(i = 1; i <= g; i++)
        dp[i] = -1;

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

        for(i = g; i >= w; i--)
            if(dp[i - w] != -1)
                dp[i] = max(dp[i], dp[i - w] + p);
    }

    best = -1;
    for(i = 0; i <= g; i++)
        best = max(best, dp[i]);

    printf("%d\n", best);

    return 0;
}