Shiro is an avid lover of Samosas. He went down to the Samosa street to have some. But he only has K units of money with him. There are N shops on the street and unfortunately, all of them have only one samosa remaining. You are also given an array A[ ] , where A_i is the cost of a samosa on the i'th shop.
Find the maximum samosas that Shiro can eat.

Input:
First line contains two space-separated integers N and K.
Second line contains N space separated integers, the cost of a samosa on the shops.

Output:
Print the answer.

Constraints:
1 ≤ N ≤ 10³
0 ≤ K ≤ 10³
0 ≤ A_i ≤ 100