#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>

using namespace std;

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