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

int max(int a, int b) {
	int x = (a > b) ? a : b;
	return x;
}

int min(int a, int b) {
	int x = (a < b) ? a : b;
	return x;
}

int binary_search(int n, vector<int> v,int key) {
	int left=0, right=n;

	while (left < right) {
		int mid = (left + right) / 2;
		if (v[mid] == key) return mid;
		else if (v[mid] < key) {
			left = mid + 1;
		}
		else if (v[mid] > key) {
			right = mid - 1;
		}
	}
}

int main() {
	int n,l;
	cin >> l>>n;
	vector<int> v(n);
	for (int i = 0; i < n; i++)cin >> v[i];

	sort(v.begin(), v.end());

	int count = 0,sum=0;
	for (int i = 0; i < v.size(); i++) {
		sum += v[i];
		
		if (sum > l)break;
		count++;
	}
	cout << count << endl;
	return 0;
}