#include <algorithm>
#include <iostream>
#include <string>

using namespace std;

int main(){
	int L, N, nowL = 0, W[10001];
	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 ((nowL + W[i]) <= L){
			nowL += W[i];
		}
		else{
			cout << i << endl;
			return 0;
		}
	}
	cout << N << endl;

	return 0;
}