#include <bits/stdc++.h>
using namespace std;
int main () {
    int N, M;
    cin >> N >> M;
    vector<int> dp(M, 0);
    for (int i = 0; i < N; i ++) {
        int s, a;
        cin >> s >> a;
        if (s > M) {
            continue;
        }
        for (int j = M; j >= s; j --) {
            dp[j] = max(dp[j], dp[j - s] + a);
        }
        for (int j = M; j > 0; j --) {
            dp[j] = max(dp[j], dp[j - 1]);
        }
    }
    cout << dp[M] << endl;
}