poj1742翻译



Poj1742:Coins

Description

People inSilverland use coins.They have coins of value A1,A2,A3...AnSilverlanddollar.One day Tony opened his money-box and found there were somecoins.He decided to buy a very nice watch in a nearby shop. He wanted to paythe exact price(without change) and he known the price would not more thanm.But he didn't know the exact price of the watch. 
You are to write a program which reads n,m,A1,A2,A3...An and C1,C2,C3...Cncorresponding to the number of Tony's coins of value A1,A2,A3...An thencalculate how many prices(form 1 to m) Tony can pay use these coins. 

Input

The input containsseveral test cases. The first line of each test case contains two integersn(1<=n<=100),m(m<=100000).The second line contains 2n integers,denoting A1,A2,A3...An,C1,C2,C3...Cn (1<=Ai<=100000,1<=Ci<=1000).The last test case is followed by two zeros.

Output

For each test caseoutput the answer on a single line.

Sample Input

3 10

1 2 4 2 1 1

2 5

1 4 2 1

0 0

Sample Output

8

4

Source

LouTiancheng@POJ

 

翻译：

Poj1742:

题目描述：

银岛上的人使用银岛币。这些金币分别价值A1,A2,A3...An银岛币。一天托尼打开他的钱包，发现有一些银岛币。他决定在附近商店买一个非常好的表。他想给商店正好的钱（就是商店不用找零）并且他知道表的价格不会超过m银岛币。但他不知道表的精确价格。

你的任务是写一个读入A1,A2,A3...An和C1,C2,C3...Cn的程序。（C1,C2,C3...Cn表示托尼有A1,A2,A3...An的个数）判断1到m中有多少种价格托尼可以付。

输入格式：

输入包括几组测试数据。每组测试数据的第一行包括2个整数n,m(1<=n<=100),m(m<=100000)。第二行包括2n个整数A1,A2,A3...An和C1,C2,C3...Cn，(1<=Ai<=100000,1<=Ci<=1000)，测试数据末尾有2个0。

输出格式：

输出每组测试数据的结果。一组一行。

输入示例：

3 10

1 2 4 2 1 1

2 5

1 4 2 1

0 0

输出示例：

8

4

来源：

LouTiancheng@POJ

翻译：ysmor