#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define forn(i,a,b) for (int i = a; i <= b; i++)
#define fi(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 pii pair <pi, pi>
# define sz(x) (int)((x).size())
#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(0); cerr.tie(0); cout.tie(0);
	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]]<op[j]+p[i]){
				op[j+w[i]]=p[i]+op[j];
				if(ans<op[j+w[i]])ans=op[j+w[i]];
			}
		}//forn(i,1,g)cout<<op[i]<<' '; cout<<'\n';
	}
	cout<<ans;
return 0;
}