#include <iostream>
#include <algorithm>
using namespace std;
 
int main(){
	int L, N;
	cin >> L >> N;
	int W[N];
	for(int i = 0; i < N; i++){
		cin >> W[i];
	}
	sort(W, W + N);
	int all = 0;
	for(int i = 0; i < N; i++){
		all += W[i];
		if(all > L){
			cout << i << endl;
			return 0;
		}
	}
	cout << N << endl;
}