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

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "rucsac";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int GMAX = 10000 + 5;

int N, G, W, P;
int D[2][GMAX];

int main() {
    int i, j;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d", &N, &G);

    for(i = 1; i <= N; i++) {
        scanf("%d%d", &W, &P);

        for(j = W; j <= G; j++)
            D[i & 1][j] = D[(i - 1) & 1][j - W] + P;

        for(j = 1; j <= G; j++)
            D[i & 1][j] = max(D[i & 1][j], D[(i - 1) & 1][j]);
    }

    printf("%d\n", D[N & 1][G]);

    return 0;
}