// Original C++ solution (slower):
/**

 *    Creator :  bizarre

 *    Date : 4/2020

 *    Problem Number : 427

**/

#include <bits/stdc++.h>

using namespace std;

#define bizarre     ios_base::sync_with_stdio( false ), cin.tie( nullptr ), cout.tie( nullptr );

/*

vector<int> prime_Numbers;

int primes[1000005];

void prime(int n)

{

    primes[1]=primes[0]=0;

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

        primes[i]=true;

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

    {

        if(primes[i]==true)

        {

            prime_Numbers.push_back(i);

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

                primes[j]=false;

        }

    }

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

        primes[i]+=primes[i-1];

}



void move1step(long long& a, long long& b, long long q)

{

    long long c= a-q*b;

    a=b;

    b=c;

}

long long egcd(long long r0,long long r1,long long& x0,long long& y0)

{

    long long x1=0,y1=1;

    x0=1;

    y0=0;

    while(r1)

    {

        long long q=r0/r1;

        move1step(r0,r1,q);

        move1step(x0,x1,q);

        move1step(y0,y1,q);

    }

    return r0;

}

bool  solve (long long a, long long b, long long c,long long&x, long long& y)

{

    long long g=egcd(a,b,x,y);

    int m=c/g;

    x*=m;

    y*=m;

    return c%g==0;

}







int npr(long long n, long long r)

{

    return (fact[n] * inv[n - r]) % mod;

}



int gcd(int a, int b)

{

    if(b==0)

        return a;

    return gcd(b,a%b);

}

void PrimeFactorization(int n)

{

    for(int i=2; i*i<=n; i++)

    {

        int c=0;

        if(n%i==0)

        {

            while(n%i==0)

            {

                n/=i;

            }



        }

    }



}

const int inf = 2e9, mod = 1e9 + 7,N=1e5+5;

long long fact[N], inv[N];

long long fp(long long base, long long exp)

{

    if (exp == 0)

        return 1;

    long long ans = fp(base, exp / 2);

    ans = (ans * ans) % mod;

    if (exp % 2 != 0)

        ans = (ans * (base % mod)) % mod;

    return ans;

}

void pre(long long n)

{

    fact[0] = 1;

    inv[0] = 1;

    for (long long i = 1; i <= n; i++)

    {

        fact[i] = (i * fact[i - 1]) % mod;

        inv[i] = fp(fact[i], mod - 2);

    }

}

int ncr(long long n, long long r)

{

    return (((fact[n] * inv[n - r]) % mod) * inv[r]) % mod;

}

long long ncrtane(long long n, long long r)

{

    long long ans=1,cntr=1;

    for(int i=n;i>n-r;i--)

    {

        ans*=i;

        ans/=cntr;

        cntr++;

    }

    return ans;

}

*/

long long dp[100005],v[100005],w[100005],V;

int main()

{

    bizarre

     long long n,x,ans=0;

     cin>>n>>x;

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

    {

        cin>>w[i]>>v[i];

        V+=v[i];

    }

    memset(dp,0x3f3f3f3f,sizeof dp);

    dp[0]=0;

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

    {

        for(int j=V;j>0;j--)

        {

            if(j-v[i]>=0)

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

        }

    }

    for(int i=0;i<=V;i++)

    {

        if(dp[i]<=x)

            ans=max(ans,(long long)i);

    }

    cout <<ans;

    return 0;

}


// Optimized solution to the same problem (faster):
#include<bits/stdc++.h>

#define ll long long

#define inf 9999999999999999

#define F first

#define S second

#define eb emplace_back

#define mpp make_pair

#define P(x) cout<<__LINE__ <<": "<<#x<<' '<<(x)<<'\n'

#define dbg cout<<__LINE__ <<": 0manush\n"

#define read(x) freopen("input.txt","r",stdin)

#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

#define pi 2*acos(0.0)

#define ee exp(1)

#define mx 100009

#define mod 10000007

using namespace std;

ll dp[109][mx];



int main(){//read(x);

//fast;

ll r,g,h,i,j,t,e,a,b,c,d,n,l,k,z=0;

cin>>n>>k;

ll w[n],p[n];l=0;

for(i=0;i<n;i++){cin>>w[i]>>p[i];l+=p[i];}

dp[n][0]=0;

for(i=1;i<=l;i++)dp[n][i]=inf;

for(i=n-1;i>=0;i--){

    for(j=0;j<=l;j++){

        dp[i][j]=min(dp[i+1][j],(j-p[i]>=0)?w[i]+dp[i+1][j-p[i]]:inf);

        //printf("%2lld ",dp[i][j]);

    }//cout<<endl;

}

a=0;

    for(j=0;j<=l;j++){

        if(dp[0][j]<=k){

            a=max(a,j);

//          cout<<j<<' '<<dp[0][j]<<endl;

        }

    }//cout<<endl;

    cout<<a<<endl;

}






// Fastest known solution for this problem: