#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define forn(i,a,b) for (int i = a; i <= b; i++)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
#define er erase
#define in insert
#define pi pair <int, int>
# define sz(x) (int)((x).size())
#define inf 1000000000
#define int long long
const ll mod = 1000000007;
const int N = 2e5 + 11;
#define N 5001
#define G 10001
ll n,g,w[N],op[G],p[N],ans;
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(); cerr.tie(); cout.tie();
	freopen("rucsac.in", "r", stdin);
	freopen("rucsac.out", "w", stdout);
	cin>>n>>g;
	forn(i,1,n)cin>>w[i]>>p[i];
	forn(i,1,n){
		for(int j=g-w[i];j>=0;j--){
			if(op[j+w[i]]<p[i]+op[j]){
				op[j+w[i]]=p[i]+op[j];
				ans=max(ans,op[j+w[i]]);
			}
		}
	}
	cout<<ans<<'\n';
return 0;
}