#include <bits/stdc++.h>
 
#define ll long long
#define pb push_back
#define fs first
#define sc second
#define PI 3.1415926535897932384626433
#define rep(i,a,b) for(ll i=(a); i<(b); i++)
#define all(x)       (x).begin(), (x).end()
#define descorder greater<int>() //for descending sort
using namespace std;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
const int N = 2e2+10, M =1e5+10, OOm = 0x3f3f3f3f;
 
string blank = "";
int n, w;
int W[N], V[N];
ll mem[N][M];
ll can(int idx, int val){
	if (val < 0)
		return 2e9;
	if (val == 0)
		return 0;
	if (idx == -1)
		return 2e9;
	if(~mem[idx][val])
		return mem[idx][val];
	return mem[idx][val] = min(can(idx-1, val-V[idx]) + W[idx], can(idx-1, val));
}
void solve(){
	memset(mem, -1, sizeof mem);
	cin >> n >> w;
	for(int i = 0; i < n; i++)
		cin >> W[i] >> V[i];
        
        //Set target and check if possible
	for(int i = 1e5; i > 0; i--){
		if(can(n-1, i) <= w){
			cout << i;
			return ;
		}
	}
}	
 
int main(){

#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	solve();
}