Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. USB Flash Drives

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputSean is trying to save a large file to a USB flash drive. He has *n* USB flash drives with capacities equal to *a*_{1}, *a*_{2}, ..., *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^{5}) — 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.

Examples

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.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/16/2019 06:35:27 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|