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

/* macro */
#define print(x) cout << x << '\n';

int main()
{
	int L, N;
	int w;
	vector<int> W;

	cin >> L >> N;

	for (int i = 0; i < N; i++)
	{
		cin >> w;
		W.push_back(w);
	}

	std::sort(W.begin(), W.end());

	int ans =  0;

	for (int i = 0; i < N; i++)
	{
		L -= W.at(i);

		if (L >= 0)
		{
			ans++;
		}
		else
		{
			break;
		}
	}

	print(ans);

	return 0;
}