#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define repeat(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()

typedef long long int64;

int main()
{
	int64 n, m;
	cin >> n >> m;

	vector<int64> C(n);
	repeat(i, n)
	{
		cin >> C[i];
	}

	sort(all(C));

	int64 ans = 0;
	repeat(i, n)
	{
		m -= C[i];
		ans += m >= 0 ? 1 : 0;
	}
	cout << ans << endl;
}