#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <iomanip>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mem(sum,x) memset(sum,x,sizeof(sum))
#define rep(i,start,end) for(int i=start;i<=end;i++)
#define per(i,end,start) for(int i=end;i>=start;i--)
#define tle ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
const int mod = 998244353;
const int mxn = 2e4 +7;
int _,n,m,k,t,u,ans,cnt,ok,lim;
ll w[mxn] , cost[mxn] , dp[mxn];
#define lc now<<1
#define rc now<<1|1
bool vis[mxn];
int main()
{
ll lim , cnt = 1 , ans = 0 ;
scanf("%d %lld",&n,&lim);
for(int i=1;i<=n;i++)
scanf("%lld %lld",&cost[i],&w[i]) , ans += w[i];
for(int i=0;i<=ans;i++)
dp[i] = mod ;
dp[0] = 0 ;
for(int i=1;i<=n;i++)
{
for(int j=ans;j>=w[i];j--)
{
dp[j] = min(dp[j] , dp[j- w[i] ]+cost[i]);
}
}
for(int i=ans;i>=0;i--)
{
if(dp[i]<=lim)
{
printf("%d\n",i);
break;
}
}
}