#include<cstdio>

 #include<iostream>

 #include<algorithm>

 using namespace std;

 int a[];

 bool cmp(int A,int B)

 {

     return A>B;

 }

 int main()

 {

     int n;scanf("%d",&n);

     int m;scanf("%d",&m);

     for(int i=;i<=n;i++)

         scanf("%d",&a[i]);

     sort(a+,a++n,cmp);

     int ans = ;

     for(int i=;i<=n;i++)

     {

         m-=a[i];

         ans++;

         if(m<=)break;

     }

     printf("%d\n",ans);

 }