2017寒假集训-小题训练1：D - USB Flash Drives

D - USB Flash Drives

 

Sean is trying to save a large file to a USB flash drive. He has n USB flash drives with capacities equal to a₁, a₂, ..., a_n megabytes. The file size is equal to m megabytes.

Find the minimum number of USB flash drives needed to write Sean's file, if he can split the file between drives.

Input

The first line contains positive integer n (1 ≤ n ≤ 100) — the number of USB flash drives.

The second line contains positive integer m (1 ≤ m ≤ 10⁵) — the size of Sean's file.

Each of the next n lines contains positive integer a_i (1 ≤ a_i ≤ 1000) — the sizes of USB flash drives in megabytes.

It is guaranteed that the answer exists, i. e. the sum of all a_i is not less than m.

Output

Print the minimum number of USB flash drives to write Sean's file, if he can split the file between drives.

Example

Input

3
5
2
1
3

Output

2

Input

3
6
2
3
2

Output

3

Input

2
5
5
10

Output

1

Note

In the first example Sean needs only two USB flash drives — the first and the third.

In the second example Sean needs all three USB flash drives.

In the third example Sean needs only one USB flash drive and he can use any available USB flash drive — the first or the second.

AC代码：http://paste.ubuntu.com/23810478/

题解：题意大致为：输入一个整数n，然后再输入一个整数m，然后输入n个整数，

然后这n个整数要“装下”m，要求输出最少使用的个数。

这题挺水的...只要把这n个整数排列一下，然后由大到小相加，只要>=m了，也就满足要求了。再随便计数一下，乃义务。