Submit solution


Points: 5
Time limit: 1.0s
Memory limit: 256M

Problem types

Mustafa realizes that winter is coming and he is hyped about big winter sales. He goes to internet to find out what he can get with his money and he lists \(\mathbf{N}\) items. After that he decides to buy maximum number of items he can buy.

Find out what Mustafa can get with \(\mathbf{M}\) money in his hand.

Input

  • First line contains integers \(\mathbf{N}\) (total number of items) and \(\mathbf{M}\) (money Mustafa has).
  • Second line contains \(\mathbf{a_1, a_2, ... ,a_n}\) as \(\mathbf{N}\) items' price.
Batch #1:
  • \(1 \leq \mathbf{N} \leq 100\)
  • \(1 \leq \mathbf{M} \leq 1000\)
  • \(1 \leq \mathbf{a_i} \leq 100\)
Batch #2:
  • \(1 \leq \mathbf{N} \leq 10^{5} \)
  • \(1 \leq \mathbf{M} \leq 10^{9}\)
  • \(1 \leq \mathbf{a_i} \leq 10^{8}\)

Output

Maximum number of items Mustafa can get

Samples

Input:

5 7
1 2 3 4 5

Output:

3

Input:

6 12
3 4 2 3 4 5

Output:

4