import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;

alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", long, "x");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void minAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) min(dst, src);
}

void maxAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) max(dst, src);
}

void main()
{
    auto dp = new long[][](100 + 1, (10 ^^ 5) * 2 + 1);
    long N, W;
    scan(N, W);
    auto w = new long[](100 + 1);
    auto v = new long[](100 + 1);
    foreach (i; 0 .. N)
        scan(w[i], v[i]);

    dp[0][] = long.max / 2;
    dp[0][0] = 0;

    foreach (n; 0 .. N)
    {
        dp[n + 1][] = long.max / 2;
        foreach (val; 0 .. 10 ^^ 5 + 1)
        {
            dp[n + 1][val].minAssign(dp[n][val]);
            // writeln(v[n]);
            dp[n + 1][val + v[n]].minAssign(dp[n][val] + w[n]);
        }
    }

    foreach_reverse (i, val; dp[N])
    {
        if (val <= W)
        {
            writeln(i);
            return;
        }
    }

}
