#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <string>
#include <functional>
#include <numeric>
#include <ctype.h>
#include <cstdlib>
#include <string.h>
#include <cmath>
#include <cstdio>
#include <map>
#include <queue>
#include <utility>

using namespace std;

const int INF = 1000000007;
const double PI = acos(-1.0);


int main()
{
	int L, N, input, sum = 0, cnt = 0;
	cin >> L >> N;
	vector<int>vec;
	for (int i = 0; i < N; i++)
	{
		cin >> input;
		vec.push_back(input);
	}
	sort(vec.begin(), vec.end());
	
	for (auto a : vec)
	{
		L -= a;
		if (L < 0)
			break;
		cnt++;
	}

	cout << cnt << endl;
	
}