#include <iostream>
#include <string>
#include <stack>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define repe(i,s,e) for(int i=s;i<e;i++)
using namespace std;

typedef pair<int, int> pii;
int main(void) {
	int a,b,c;
	std::priority_queue<int> pq;
	cin>>a>>b;
	rep(i,b)cin>>c,pq.push(c);
	int k=0;
	int z=0;
	while(!pq.empty()){
		int t=pq.top();
		if(t+z<a)break;
		z+=t;
		k++;
	}
	cout<<k<<endl;
	return 0;
}