#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())
int n, g, x, y, a[10005][10005];
vector<pi>v;

int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0); cerr.tie(0); cout.tie(0);
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
	cin>>n>>g;
	v.pb(mp(0,0));
	forn(i,1,n){
		cin>>x>>y;
		v.pb(mp(x,y));
	}
	sort(v.begin(),v.end());
	forn(i,1,n){
		forn(j,v[i].ff,g){
			if(v[i].ff<=j)a[i][j]=max(a[i][j],v[i].ss+a[i-1][j-v[i].ff]);
		}
	}
	cout<<a[n][g];
return 0;
}