#include<bits/stdc++.h>
using namespace std;
int n, b, ans;
int x[20001];
bool cmp(int n, int y) {
	return n >= y;
}
int main() {
	cin >> n >> b;
	for (int i = 1; i <= n; i++)
		cin >> x[i];
	sort(x + 1, x + n + 1, cmp);
	for (int i = 1; i <= n; i++) {
		ans++;
		b -= x[i];
		if (b <= 0)
			break;
	}
	cout << ans;
	return 0;
}