#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,x,maxim,k,minim,i1,i,g1,g;
struct TomFord
{
    int l,g;
};
TomFord v[100004];
int main()
{
    fin>>n>>g1;
    v[0].l=1;
    for(int i=1;i<=n;i++)
    {
        fin>>g>>x;
        for(int i=maxim;i>=0;i--)
            if(v[i].l>=1)
            {
                v[i+x].l++;
                v[i+x].g=v[i].g+g;
                if(v[i+x].g<=g1)
                    maxim=max(i+x,maxim);
            }
    }
    fout<<maxim;
    return 0;
}