描述：



需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。





输入：



多个测例，每个测例的输入占三行。第一行两个整数：n（n<=10）和c，第二行n个整数分别是w1到wn，第三行n个整数分别是p1到pn。

n 和 c 都等于零标志输入结束。





输出：



每个测例的输出占一行，输出一个整数，即最佳装载的总价值。





输入样例：



1 2

1

1

2 3

2 2

3 4

0 0





输出样例：



1

4-Descr iption: The need for a capacity of c backpack loaded. Loaded backpack of items selected from n items, items i weight of wi, the value of pi. Feasible backpack load, the total weight of the items in the backpack can not exceed the capacity of the backpack, the best load is the highest value of goods loaded. Input: more test cases, each input test cases accounted for three lines. The first row of two integers: n (n < = 10), and c, the second row of n integers are W1 to WN n integers, respectively, of the third row is the p1 to Pn. n and c are equal to zero to the end of the flag input. Output: the output of each test cases per line, output an integer, that is the best total value loaded. SAMPLE INPUT: 1 2 1 1 2 3 2 2 3 4 0 0 sample output: 14