#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair<ll, ll>
#define sz(x) (int)((x).size())
#define all(a) (a).begin(), (a).end()

/* int f[maxn],nf[maxn],inv[maxn];
const int M=998244353;
void init(){
    inv[1]=1; for (int i=2;i<maxn;i++) inv[i]=M-1ll*(M/i)*inv[M%i]%M;
    f[0]=nf[0]=1; for (int i=1;i<maxn;i++) f[i]=1ll*f[i-1]*i%M,nf[i]=1ll*nf[i-1]*inv[i]%M;
}
int C(int x,int y){return 1ll*f[x]*nf[y]%M*nf[x-y]%M;}*/
const ll mod = 1e9+7;
ll n, k, m, mi, ma;

void solve(){
	
	ifstream cin("rucsac.in");
	ofstream cout("rucsac.out");
	
	ll g;
	cin >> n >> g;
	vector<ll> w, p;
	w.pb(-1);
	p.pb(-1);
	ll z = 0;
	for(int i = 0; i<n; i++){
		ll P, W;
		cin >> W >> P;
		if(W == 0){
			z += P;
			continue;
		}
		w.pb(W); p.pb(P);
	}
	n = w.size();
	ll dp[n + 1][g + 1];
	for(int i = 0; i<=n; i++){
		for(int j = 0; j<=g; j++){
			if(i*j == 0){
				dp[i][j] = 0;
				continue;
			}
			dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
			if(w[i] > j) continue;
			dp[i][j] = max(dp[i][j], dp[i - 1][j - w[i]] + p[i]);
		}
	}
	
	cout << z + dp[n][g] << "\n";
}

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