#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cstring>

 using namespace std;

 const int N=5e4;

 int dp[N+];

 int n,W;

 int main ()

 {

     while (~scanf ("%d %d",&n,&W)) {

         memset (dp,0x3f,sizeof(dp));

         dp[]=;

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

             int cost,value;

             scanf ("%d %d",&cost,&value);

             for (int j=N;j>=value;j--)

                 dp[j]=min(dp[j],dp[j-value]+cost);

         }

        for (int i=N;i>=;i--)

             if (dp[i]<=W) {

                 printf ("%d\n",i);

                 break;

             }

     }

     return ;

 }