//ALEXANDRU MICLEA

#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>
#include <assert.h>
#include <iostream>

using namespace std;
using ll = long long;

#define fast_cin() 	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

//VARIABLES

const int maxg = 1e5 + 5;
const int maxn = 5e3 + 5;

int dp[maxg];
int gr[maxn];
int p[maxn];

//FUNCTIONS



//MAIN

int main() {

	#ifdef INFOARENA
	freopen("rucsac.in", "r", stdin);
	freopen("rucsac.out", "w", stdout);
	#endif

	fast_cin();

	int n, g; cin >> n >> g;
	for (int i = 1; i <= n; i++) {
		cin >> gr[i] >> p[i];
	}

	for (int i = 1; i <= n; i++) {
		for (int j = g - gr[i]; j >= 0; j -- ) {
			dp[j + gr[i]] = max(dp[j] + p[i], dp[j + gr[i]]);
		}
	}

	cout << dp[g];

	return 0;
}