#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;

int N, M;
int C[11];

int main()
{
	cin >> N >> M;
	for (int i = 0; i < N; i++) {
		cin >> C[i];
	}
	sort(C,C+N);

	int ans = 0;
	for (int i = 0; i < N; i++) {
		M -= C[i];
		if (M <= 0) {
			if (M == 0)ans++;
			break;
		}
		ans++;
	}
	cout << ans << endl;
	return 0;
}