POJ3624手链

POJ3624 Description


Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weight Wi (1 ≤ Wi ≤ 400), a 'desirability' factor Di (1 ≤ Di ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).


Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.


Input


* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: Wi and Di


Output


* Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints


Sample Input


4 6
1 4
2 6
3 12
2 7
Sample Output


23


Description
贝茜在珠宝店闲逛时，买到了一个中意的手镯。很自然地，
她想从她收集的 N(1 <= N <= 3402)块宝石中选出最好的那些镶在手镯上。
对于第i块宝石，它的重量为W_i(1 <= W_i <= 400)，
并且贝茜知道它在镶上手镯后能为自己增加的魅力值D_i(1 <= D_i <= 100)。
由于贝茜只能忍受重量不超过M(1 <= M <= 12880)的手镯，她可能无法把所有喜欢的宝石都镶上。
于是贝茜找到了你，告诉了你她所有宝石的属性以及她能忍受的重量，希望你能帮她计算一下，
按照最合理的方案镶嵌宝石的话，她的魅力值最多能增加多少。


输入
* 第1行: 2个用空格隔开的整数：N 和 M
* 第2..N+1行: 第i+1行为2个用空格隔开的整数：W_i、D_i，分别为第i块宝石 的重量与能为贝茜增加的魅力值


输出

* 1行：一个整数，是魅力的有利条件，可以实现给定的重量限制的最大数