// 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.4572468222166517x):
// Author : ZERO_IQ

// Practice is the only shortcut to improve



#pragma GCC optimize ("O3")

#pragma GCC optimize ("unroll-loops")



#include <bits/stdc++.h>



using namespace std;

using ll = long long;



#define debug(x, y) cerr << (#x) << " " << (#y) <<" is " << (x) <<" "<< (y) << endl

#define debug2(x, y, z) cerr << (#x) << " " <<(#y) << " " << (#z) << " is " << (x) << " " << (y) << " " << (z) << endl

#define endl '\n'



ll const N = 1e7 + 1;



int main() {

    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    /*#ifndef ONLINE_JUDGE

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

        freopen("output.txt", "w", stdout);

    #endif*/

    long long n, m;

    cin >> n >> m;

    vector<pair<long long, long long >> input;

    long long summ = 0;

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

        long long q, qq;

        cin >> q >> qq;

        input.push_back({q, qq});

        summ += qq;

    }

    vector<vector<long long>> dp(n, vector<long long>(summ + 2, 1e18));

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

        dp[var][0] = 0;

    }

    ll maxx = 0;

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

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

            if (!j) {

                if (i == input[j].second)

                    dp[j][i] = input[j].first;

            } else if (input[j].second > i) {

                dp[j][i] = dp[j - 1][i];

            } else {

                dp[j][i] = min(dp[j - 1][i], dp[j - 1][i - input[j].second]

                               + input[j].first);

            }

        }

    }

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

        if (dp[n - 1][i] <= m) {

            maxx = i;

        }

    }

    cout << maxx << endl;

    return 0;

}