#include <bits/stdc++.h>
#define ll long long
#define nl '\n'
#define FOR(i, a, b) for (int i = a; i <= b; ++i) 
#define F0R(i, a, b) for (int i = a; i >= b; --i)
#define FORd(i, n) for (int i = 0; i < n; ++i)
#define F0Rd(i, n) for (int i = n - 1; i >= 0; --i)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxG = 1e4 + 5;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

void solve() {
    int N, G;
    fin >> N >> G;

    vector<pair<int, int>> v(N);
    FORd(i, N) {
        fin >> v[i].first;
        fin >> v[i].second;
    }

    vector<int> dp(mxG);
    FORd(i, N) {
        F0Rd(j, G + 1) {
            if (j == 0 || dp[j] != 0) {
                dp[j + v[i].first] = max(dp[j + v[i].first], dp[j] + v[i].second);
            }
        }
    }

    int ans = 0;
    FORd(i, G + 1) ans = max(ans, dp[i]);
    fout << ans;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(0);
    int T = 1;
    //cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}