It's a problem about coins.
You have n (1<=n<=10) types of coins. Each coin has different value, ai. The number of each coin you has is bi. Then you want to buy something which price is p (1<=p<=10000). You are so lazy that you want to go out with coins as less as possilble. And you think carrying coins to home is tired. So you only carry coins the sum of which's value equal to p. If your all coins' summary less than p, output "I am so poor!", else if you can't carry coins which value equals to p, output "How bad!", else output the minimum coins you can carry.
There are many testcases.
In each testcase, the first line is n and p, the next line has n integers, ai(1<=ai), the next line has n integers bi (1<=bi<=100)
Each testcase output one line about your answer.