#define NMAX 5002
#define GMAX 10002
#define ll long long
#define mkp make_pair

#include <bits/stdc++.h>

using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define dbg(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif


struct Backpack {
    int w, p;
};

int N, G;
vector<vector<int> > dp;
Backpack backpack[NMAX];
ifstream f ("rucsac.in") ;
ofstream g ("rucsac.out");
int main() {
    f >> N >> G;
    dp = vector<vector<int>>(2, vector<int>(G + 1, 0));
    for (int i = 1; i <= N; ++i)
        f >> backpack[i].w >> backpack[i].p;

    for (int i = 1; i <= N; ++i) {
        for (int c = 1; c <= G; ++c)
            if (c >= backpack[i].w)
                dp[1][c] = max(dp[0][c], dp[0][c - backpack[i].w] + backpack[i].p);
            else
                dp[1][c] = dp[0][c];

        dp[0] = dp[1];
        dp[1] = vector<int>(G + 1, 0);
    }

    g << dp[0][G];
    return 0;
}