using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using System.Text;

namespace EDP_E
{
    class Program
    {
        static readonly long VALUE_LIMIT = 100000;
        static readonly long INF = long.MaxValue / 11;

        struct Item
        {
            public long Value { get; set; }
            public long Weight { get; set; }

            public Item(long v, long w)
            {
                Value = v;
                Weight = w;
            }
        }

        // wsize制約が非常に大きい
        static long knapsack(long vsize, long wsize, List<Item> items)
        {
            var n = items.Count();
            // [i][v] iまでのitemで、v以上となる最小の重さ
            var c = new long[n + 1, vsize + 1];

            for (long i = 0; i < c.GetLongLength(0); i++)
            {
                for (long j = 1; j < c.GetLongLength(1); j++)
                {
                    c[i, j] = INF;
                }
            }

            for (int i = 0; i < n; i++)
            {
                for (long v = 0; v <= vsize; v++)
                {
                    if (v >= items[i].Value)
                    {
                        c[i + 1, v] = Math.Min(c[i, v], c[i, v - items[i].Value] + items[i].Weight);
                    }
                    else
                    {
                        c[i + 1, v] = c[i, v];
                    }
                }
            }

            var max = 0L;
            for (long v = 0; v <= vsize; v++)
            {
                if (c[n, v] <= wsize) max = v;
            }

            return max;
        }

        static void Solve()
        {
            var n = Input.NextInt();
            var wsize = Input.NextInt();
            var items = new List<Item>();

            foreach (var i in Enumerable.Range(0, n))
            {
                var w = Input.NextInt();
                var v = Input.NextInt();
                items.Add(new Item(v, w));
            }

            var ans = knapsack(VALUE_LIMIT, wsize, items);

            Console.WriteLine(ans);
        }

        #region Competitive Template
        public static void Main(string[] args)
        {
            var needsFlushOutput = true;
            if (needsFlushOutput)
            {
                // 細かく出力しないようにする
                var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
                Console.SetOut(sw);
            }

            // 仮想的に標準入力をセットする
            // NextLine系を使っていると使えない
            //Input.SetText("");

            Solve();

            Console.Out.Flush();
        }

        static class Input
        {
            static char[] separator = { ' ' };
            public static bool IsEof { get; set; }
            static Queue<string> q { get; set; }

            static Input()
            {
                IsEof = false;
                q = new Queue<string>();
            }

            /// <summary>
            /// 入力予約
            /// </summary>
            /// <param name="items"></param>
            public static void SetText(IEnumerable<string> items)
            {
                foreach (var item in items)
                {
                    SetText(item);
                }
            }

            /// <summary>
            /// 入力予約
            /// </summary>
            /// <param name="s"></param>
            /// <returns></returns>
            public static bool SetText(string s)
            {
                if (s == null) return false;

                foreach (var elem in s.Trim().Split(separator, StringSplitOptions.RemoveEmptyEntries))
                {
                    q.Enqueue(elem);
                }

                return true;
            }

            /// <summary>
            /// 内部queueに入力からの値をsplitして格納する
            /// </summary>
            /// <returns></returns>
            static bool read()
            {
                var s = Console.ReadLine();
                if (s == null) return false;

                foreach (var elem in s.Trim().Split(separator, StringSplitOptions.RemoveEmptyEntries))
                {
                    q.Enqueue(elem);
                }

                if (!q.Any()) return read();

                return true;
            }

            /// <summary>
            /// 次のstringを一つ読み込む
            /// </summary>
            /// <returns></returns>
            public static string Next()
            {
                if (!q.Any())
                {
                    if (!read())
                    {
                        IsEof = true;
                        return "";
                    }
                }

                return q.Dequeue();
            }

            public static int NextInt() => int.Parse(Next());
            public static long NextLong() => long.Parse(Next());
            public static double NextDouble() => double.Parse(Next());

            public static List<string> Next(int n) => Enumerable.Range(0, n).Select(_ => Next()).ToList();
            public static List<int> NextInt(int n) => Next(n).Select(x => int.Parse(x)).ToList();
            public static List<long> NextLong(int n) => Next(n).Select(x => long.Parse(x)).ToList();
            public static List<double> NextDouble(int n) => Next(n).Select(x => double.Parse(x)).ToList();

            public static List<string> NextLine() => Console.ReadLine().Trim().Split(separator, StringSplitOptions.RemoveEmptyEntries).ToList();
            public static List<int> NextIntLine() => NextLine().Select(x => int.Parse(x)).ToList();
            public static List<long> NextLongLine() => NextLine().Select(x => long.Parse(x)).ToList();
            public static List<double> NextDoubleLine() => NextLine().Select(x => double.Parse(x)).ToList();
        }
        #endregion
    }
}


Measured memory_bytes: 92128