#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;


const int mod=1e9+7;
const int modx=998244353;
const int per=666013;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int n,g,dp[10005];
pair<int,int>a[5005];

int32_t main(){
	//ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    fin >> n >> g;
    for(int i=1;i<=n;i++){
        fin >> a[i].fr >> a[i].sc;
    }
    for(int i=1;i<=n;i++){
        for(int j=g;j>=0;j--){
            if(j-a[i].fr>=0 && (j-a[i].fr==0 || dp[j-a[i].fr]>0)) dp[j]=max(dp[j],dp[j-a[i].fr]+a[i].sc);
        }
    }
    int ans=*max_element(dp,dp+g+1);
    fout << ans << '\n';
}