#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;

int main()
{
	int L, n, x;
	vector<int>v;
	cin >> L >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> x;
		v.push_back(x);
	}
	sort(v.begin(), v.end());
	int sum = 0, cnt = 0, a = v[0];
	while (sum + a <= L)
	{
		cnt++;
		sum += a;
		if (cnt < n)	a = v[cnt];
		else break;
	}
	cout << cnt << endl;
	return 0;
}