You have N items that you want to put them into a knapsack. Item i has value vi and weight wi.

You want to find a subset of items to put such that:

* The total value of the items is as large as possible.
* The items have combined weight at most W, that is capacity of the knapsack.



Find the maximum total value of items in the knapsack.

Constraints

* 1 ≤ N ≤ 100
* 1 ≤ vi ≤ 100
* 1 ≤ wi ≤ 10,000,000
* 1 ≤ W ≤ 1,000,000,000

Input


N W
v1 w1
v2 w2
:
vN wN


The first line consists of the integers N and W. In the following N lines, the value and weight of the i-th item are given.

Output

Print the maximum total values of the items in a line.

Examples

Input

4 5
4 2
5 2
2 1
8 3


Output

13


Input

2 20
5 9
4 10


Output

9
#include <bits/stdc++.h>
using namespace std;
const int N = 100, M = 100000002;
int n, w[N], v[M], W;
int dp[N][M];//从第i个物品到最后一个（n-1）物品，总重量不超过j的最大价值
int main(){
    scanf("%d %d", &n, &W);
    for(int i = 0; i < n; i++) scanf("%d %d", &v[i], &w[i]);

    for(int j = 0; j <= W; j++) dp[n][j] = 0;
    for(int i = n-1; i >= 0; i--){
        for(int j = 0; j <= W; j++){
            if(w[i] > j){
                dp[i][j] = dp[i+1][j];
            }
            else{
                dp[i][j] = max(dp[i+1][j], dp[i+1][j-w[i]]+v[i]);
            }
        }
    }
    printf("%d\n", dp[0][W]);
    return 0;
}
