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

using namespace std;

int main(){
	int L, N;
	vector<double> W;
	double x;

	cin >> L >> N;

	for (int i = 0; i < N; i++){
		cin >> x;
		W.push_back(x);
	}

	sort(W.begin(), W.end());
	
	double SAM=0.0;
	int i = 0;
	while (SAM <= L){
		SAM += W[i];
		i++;
	}

	cout << i-1 << endl;
}