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.

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.

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

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.

#include <iostream>
#include<algorithm>
using namespace std;
int a[101];
int main()
{
    int n;
    cin>>n;
    int m;
    cin>>m;


     for(int i=1;i<=n;i++)
     {
         cin>>a[i];
     }
     sort(a,a+n+1);
     int sum=0;
     int sign=0;
     for(int i=n;i>=1;i--)
     {
           sum+=a[i];
           sign++;
           if(sum>=m)
           {
               break;
           }
     }
     cout<<sign<<endl;
    return 0;
}