#include <iostream>
#include <sstream>
#include <math.h>
#include <stack>
#include <set>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <vector>
using namespace std;

#define INF (1 << 30)
#define INFLL (1LL << 60)

int l,n,w[10001];
int ans = 0;
long long int sum = 0;

int main() {
	cin >> l >> n;
	for(int i = 0;i < n;i++){
		cin >> w[i];
	}
	sort(w,w + n);
	for(int i = 0;i < n;i++){
		if(sum + w[i] <= l) {
			sum += w[i];
			ans++;
		}
	}
	cout << ans << endl;
	return 0;
}