// Slower C++ solution:
/**

 *  Author : Coda

 *  Title : OSU!

 *  Date : 2019-08-20

 */

#include <bits/stdc++.h>

using namespace std ;



typedef long long ll ;

typedef unsigned long long ull ;

typedef double DB ;

const long long mod = 1e9+7 ;

const double pi = acos(-1) ;

#define PB push_back

#define MP make_pair

#define lb lower_bound

#define ub upper_bound

#define fs first

#define sd second

#define pii pair<int,int>

#define INF 0x3f3f3f3f

#define LLINF 0x3f3f3f3f3f3f3f3f

#define debug(x) cout << #x << " = " << x << endl

#define debug2(x,y) cout << #x << " = " << x << ' ' << #y << " = " << y << endl

#define debug3(x,y,z) cout << #x << " = " << x << ' ' << #y << " = " << y << ' ' << #z << " = " << z << endl

//#pragma comment(linker,"/STACK:10240000,10240000")

//#include <random>

//mt19937 rand_(time(0));

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}

ll qpow(ll a,ll b,ll c){ll t=1;while(b){if(b&1)t=t*a%c;a=a*a%c;b>>=1;}return t;}

ll inv(ll x){return qpow(x,mod-2,mod);}

int test = 1 ;



const int maxn = 5 + 3e5 ;

const int maxm = 5 + 1e6 ;

// Write the variables here



int N,W ;

ll v[maxn],w[maxn] ;

ll dp[maxn] ;



//#define TEST

int main(){

#ifdef TEST

    freopen("in.txt","r",stdin) ;

#endif

    while(test--){

        // code begins

        scanf("%d%d",&N,&W) ;



        ll sum = 0 ;

        for(int i=1 ; i<=N ; i++){

            scanf("%lld%lld",&w[i],&v[i]) ;

        }

        for(int i=1 ; i<=100000 ; i++){

            dp[i] = LLINF ;

        }

        dp[0] = 0;

        ll ans = 0 ;

        for(int i=1 ; i<=N ; i++){

            for(int j=100000 ; j>=v[i] ; j--){

                dp[j] = min(dp[j],dp[j-v[i]]+w[i]);

            }

        }

        for(int i=1 ; i<=100000 ; i++){

            if(dp[i]<=W) ans = max(ans,i*1ll) ;

        }

        printf("%lld\n",ans) ;



    }

#ifdef TEST

    cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;

#endif

    return 0 ;

}


// Faster C++ solution for the same problem (measured speedup: 2.508237697216426x):
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define  pb push_back

#define f first

#define s second

#define INF_INT 1e9+5

#define INF_LONG 1e18



///shortcuts

///ctr+alr+T

ll my_max(ll a, ll b)

{

    return a>b? a: b;

}



int main()

{

    ios::sync_with_stdio(false);

    cin.tie(0);



    int n , w; cin>>n>>w;

    vector< pair<ll,ll> > v;

    v.pb({0,0});

    ll sum = 0;

    for (int i = 0; i < n; ++i) {

        ll ww;

        ll  vv;

        cin>>ww>>vv;

        v.pb({vv,ww});

        sum+=vv;

    }



    vector<vector<ll> > dp(n+1,vector<ll>(sum+1,INF_LONG));

    //sort(v.begin(),v.end());

   /* for(auto itr : v)

        cout<<itr.f<<" ";

    cout<<endl;

    for(auto itr : v)

        cout<<itr.s<<" ";

    cout<<endl;*/



   dp[0][0] = 0 ; //minimum possible  weight;



    ll mx  = 0;

   // cout<<"haha"<<endl;

    for (ll item = 1; item <= n ; item++) {

        for (ll value = 0; value <= sum; value++)

        {

            if (v[item].f <= value) {

             //find the minimum weight

                dp[item][value] = min (v[item].s + dp[item - 1][value - v[item].f], dp[item - 1][value]);

            }

            else {

                dp[item][value] = dp[item - 1][value];

            }

           //cout<<dp[item][value]<<" ";

            if(dp[item][value]<=w)

            mx = my_max(mx  ,value);

        }

        //cout<<endl<<endl;

    }

   cout<<mx<<endl;













}