// Slower C++ solution:
#include<set>

#include<map>

#include<cmath>

#include<ctime>

#include<queue>

#include<stack>

#include<cstdio>

#include<string>

#include<vector>

#include<random>

#include<cstdlib>

#include<cstring>

#include<iomanip>

#include<iostream>

#include<algorithm>

#include<unordered_map>

#define endl "\n"

#define fi first

#define se second

#define db double

#define gcd __gcd

#define pb push_back

#define mp make_pair

#define lowbit(x) (x & (-x))

#define PII  pair<int, int> 

#define all(x) x.begin(), x.end()

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

#define rep(i, a, b) for(__typeof(b) i = a; i <= (b); i++)

#define Rep(i, a, b) for(__typeof(a) i = a; i >= (b); i--)

#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

template<class T> inline T qmin(T a, T b) { return a < b ? a : b; }

template<class T> inline T qmax(T a, T b) { return a > b ? a : b; }

typedef long long ll;

typedef unsigned long long ull;

const db eps = 1e-9;

const db PI = acos(-1);

const int inf = 0x3f3f3f3f;

const int mod = (int)1e9 + 7;

const int maxn = (int)1e5 + 5;//remember to modify it, No RE or MLE

const ll INF = 0x3f3f3f3f3f3f3f3f;

using namespace std;

ll qpow(ll x, ll y) { ll ret = 1; for( ; y; y >>= 1, x = (x * x) % mod) if(y & 1) ret = (ret * x) % mod; return ret; }



inline int read(){

	char ch = getchar();

	int x = 0, f = 1;

	while(ch < '0' || ch > '9'){

		if(ch == '-') f = -1;

		ch = getchar();

	}

	while('0' <= ch && ch <= '9'){

		x = x * 10 + ch - '0';

		ch = getchar();

	}

	return x * f;

}



int n, W;

int w[105], v[105];

ll dp[maxn];



int main()

{

	n = read(), W = read();

	rep(i, 1, n) w[i] = read(), v[i] = read();

	memset(dp, 0x3f, sizeof dp);

	dp[0] = 0;

	rep(i, 1, n){

		Rep(j, maxn - 1, v[i]){

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

		}

	}

	Rep(i, maxn - 1, 0){

		if(dp[i] <= W) return 0 * printf("%d\n", i);

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 2.449083677974422x):
#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;













}