#include <bits/stdc++.h>
#define fi second
#define se first
#define MAXN 5005
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, k, suf[MAXN], ans=0, sum=0, val=0;
pair<int, int>x[MAXN];
void bkt(int i);
int main()
{
    fin>>n>>k;
    for (int i=1; i<=n; i++) {
        fin>>x[i].fi>>x[i].se;
    }
    sort(x+1, x+n+1, greater<pair<int, int>>());
    for (int i=n; i>=1; i--) suf[i]=suf[i+1]+x[i].se;
    bkt(1);
    fout<<ans;
    return 0;
}
void bkt(int i) {
    if (sum>k) return ;
    if (val+suf[i]<ans) return ;
    if (i>n) {
        ans=max(ans, val);
        return ;
    }
    sum+=x[i].fi;
    val+=x[i].se;
    bkt(i+1);
    sum-=x[i].fi;
    val-=x[i].se;
    bkt(i+1);
}