#include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <string>

using namespace std;

int main() {

	int L, N, W[10005];

	cin >> L >> N;
	for (int i = 0; i < N; i++) {
		cin >> W[i];
	}

	sort(W, W+N);

	int sum = 0, cnt = 0;

	for (int i = 0; i < N; i++) {
		sum += W[i];
		if (sum > L) {
			break;
		}
		cnt++;
	}

	cout << cnt<< endl;

	return 0;
}