#include <iostream>
using namespace std;
typedef long long ll;

int N, W;
int w[105], v[10005];
ll dp[105][100005];

ll rec(int at, int value_left){
   ll res = 2e9;
   if(value_left == 0){
       return 0;
   }
   if(at == N){
       return 2e9;
   }
   if(dp[at][value_left] != -1){
       return dp[at][value_left];
   }
   res = min(res, rec(at + 1, value_left));
   if(value_left >= v[at]){
       res = min(res, rec(at + 1, value_left - v[at]) + w[at]);
   }
   return dp[at][value_left] = res;

}

int main() {
   int sum = 0;
   cin >> N >> W;
   for(int i = 0; i < N; i++){
       cin >> w[i] >> v[i];
       sum += v[i];
   }
   memset(dp, -1, sizeof(dp));
   for(int i = sum; i > 0; i--){
       if(rec(0, i) <= W){
           cout << i << endl;
           break;
       }
   }

   return 0;
}