#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>

#define loop while(1)
#define SZ(x) ((int)(x).size())
#define tep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define pushb push_back
#define popb pop_back

#define i64 long long int
#define veci vector<int> 
#define vveci vector<VI>
#define veci64 vector<i64>


using namespace std;


int main()
{
	int l,n;
	veci w;
	int tmp;
	cin>>l>>n;
	tep(i,n){
		cin>>tmp;
		w.pushb(tmp);
	}
	sort(w.begin(),w.end());
	int score =0;
	int num=0;
	while(score<=l && num <w.size()){
		score+=w[num];
		if(score<=l){
			num++;
		}
	}
	cout<<num<<endl;
	return 0;
}