Problem:
Score : 100 points

Problem Statement

There are N items, numbered 1, 2, \ldots, N.
For each i (1 \leq i \leq N), Item i has a weight of w_i and a value of v_i.

Taro has decided to choose some of the N items and carry them home in a knapsack.
The capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.

Find the maximum possible sum of the values of items that Taro takes home.

Constraints

All values in input are integers.

1 \leq N \leq 100

1 \leq W \leq 10^9

1 \leq w_i \leq W

1 \leq v_i \leq 10^3

Input

Input is given from Standard Input in the following format:

N W
w_1 v_1
w_2 v_2
:
w_N v_N

Output

Print the maximum possible sum of the values of items that Taro takes home.

Sample Input 1

3 8
3 30
4 50
5 60

Sample Output 1

90

Items 1 and 3 should be taken.
Then, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.

Sample Input 2

1 1000000000
1000000000 10

Sample Output 2

10

Sample Input 3

6 15
6 5
5 6
6 4
6 6
3 5
7 2

Sample Output 3

17

Items 2, 4 and 5 should be taken.
Then, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.

Solution in C++14 (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define PAUSE \
	int t;    \
	cin >> t
#define int long long
#define vi vector<long long>
#define mapii map<long long, int>
#define mapci map<char, int>
#define append(x) push_back(x)
#define tcase          \
	long long t;       \
	scanf("%lld", &t); \
	while (t--)
#define prq priority_queue
#define fio                           \
	ios_base::sync_with_stdio(false); \
	cin.tie(NULL)
// #define debug(x, y) cout<<"case #"<<x<<" at itr #"<<y<<endl
#define debug(x) cout << "case #" << x << endl
#define ff first
#define ss second
#define range(ini, x) for (int itr = ini; itr < x; itr++)
#define takearr(x)    \
	for (auto &i : x) \
	cin >> i
#define print(x)     \
	for (auto i : x) \
		cout << i << " ";
#define FOR(x, y) for (int i = x; i < y; i++)
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define foreach(i, x) for (auto i : x)
#define vi2d vector <array<int,2>>
#define ar array
#define setbitcount __builtin_popcount
//******************/
// #ifndef ONLINE_JUDGE
// 	freopen("input.txt", "r", stdin);
// 	freopen("output.txt", "w", stdout);
// #endif
//******************/
// #define range(ini, x, step) for( int itr = ini, i < x; itr += step )
using namespace std;
// using namespace __gnu_pbds;
// template < class type > using oset=tree<type, null_type,less<type>, rb_tree_tag,tree_order_statistics_node_update>;
const int mmx = 1e5 + 5;
const int mnx = 1e4 + 1;
const int mmod = 1e9 + 7;

int n, w;
vi2d arr; // weight cost
map < int, int> hashing;

int dp[110][100010];

int func( int index, int weight ){
	if( index >= n || weight <= 0 ){
		dp[index][ hashing[index] ] = 0;
		return dp[index][hashing[index]];
	}
	if( weight - arr[index][0] >= 0 ){
		dp[index][ hashing[index] ] = max( arr[index][1] + func( index + 1, weight - arr[index][0] ), func( index + 1, weight ) );
		return dp[index][ hashing[index] ];
	}
	else{
		dp[index][ hashing[index] ] = func( index + 1, weight );
		return dp[index][ hashing[index] ];
	}
}

// int func( int index, int item, int weight ){

// 	if( index >= n || weight <= 0 ){
// 		return 0;
// 	}

// 	if( weight - hashing[ { index, item } ] >= 0 && index + 1 < n ){
// 		return max( arr[index][1] + func( index + 1, arr[index + 1][1], weight - hashing[{ index + 1, arr[index+1][1] }] ),
// 					func( index + 1, arr[index + 1][1], weight ) );
// 	}
// 	else{
// 		return func( index + 1, arr[index + 1][1], weight );
// 	}
// }

signed main()
{
	memset(dp, -1, sizeof dp);

 	cin>>n>>w;
 	for0(i,n){
 		int x, y;
 		cin>>x>>y;
 		arr.push_back({x,y});
 		hashing[i] = y;
 	}

 	// cout<<func(0,arr[0][1],w)<<endl;
 	cout<<func(0,w)<<endl;

	return 0;
}