#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "rucsac.in";
const char outfile[] = "rucsac.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 5005;
const int MAXG = 10005;
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

pair<int, int> P[MAXN];
int dp[2][MAXG];
int N, G;

int main() {
    fin >> N >> G;
    for(int i = 1 ; i <= N ; ++ i)
        fin >> P[i].first >> P[i].second;
    for(int i = 1 ; i <= N ; ++ i) {
        for(int j = 1 ; j <= G ; ++ j) {
            dp[i & 1][j] = dp[i & 1 ^ 1][j];
            if(j >= P[i].first)
                dp[i & 1][j] = max(dp[i & 1][j], dp[i & 1 ^ 1][j - P[i].first] + P[i].second);
        }
    }
    fout << dp[N & 1][G] << '\n';
    fin.close();
    fout.close();
    return 0;
}