#include <bits/stdc++.h>
using namespace std;

using ll=long long;
ll mod=1000000007;
ll INF=1LL<<60;

int main() {
	int L,N;
	cin >> L >> N;
	vector<int> W(N);
	for(int i=0;i<N;i++){
		cin >> W[i];
	}
	sort(W.begin(),W.end());
	int cnt=0;
	for(int i=0;i<N;i++){
		if(W[i]>L)continue;
		else{
			L-=W[i];
			cnt++;
		}
	}
	cout << cnt << endl;
}