您的位置:首页 > 其它

最多买几件

2015-11-08 13:26 183 查看
Limit: 1 Sec Memory Limit: 128 MB

Submit: 11 Solved: 2
[Submit][Status][Web
Board] [Edit] [TestData]


Description

As you know, Gardon trid hard for his love-letter, and now he's spending too much time on choosing flowers for Angel.

When Gardon entered the flower shop, he was frightened and dazed by thousands kinds of flowers.

"How can I choose!" Gardon shouted out.

Finally, Gardon-- a no-EQ man decided to buy flowers as many as possible.

Can you compute how many flowers Gardon can buy at most?


Input

Input have serveral test cases. Each case has two lines.

The first line contains two integers: N and M. M means how much money Gardon have.

N integers following, means the prices of differnt flowers.


Output

For each case, print how many flowers Gardon can buy at most.

You may firmly assume the number of each kind of flower is enough.


Sample Input

2 5
2 3


Sample Output

2


HINT


Source

Xwxcy
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: