#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#define _USE_MATH_DEFINES
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define RREP(i,n) for(int (i)=(n)-1;(i)>=0;(i)--)
#define debug(x) cout<<x<<endl
using namespace std;
typedef pair<int,int> P;
typedef priority_queue<int> maxpq;
typedef priority_queue<int,vector<int>,greater<int> > minpq;
typedef priority_queue<P> p_maxpq;
typedef priority_queue<P,vector<P>,greater<P> > p_minpq;
typedef vector<int> veci;
typedef vector<P> vecp;
typedef vector<string> vecs;
#define INF 2000000000
struct edge{int to,cost;};

int main(void) {
	int L,N;cin >> L >> N;
	minpq que;
	REP(i,N) {
		int w;cin >> w;
		que.push(w);
	}
	int wid = 0,ans = 0;
	while(!que.empty()) {
		int w = que.top();que.pop();
		if(wid+w<=L) {
			wid += w;
			ans++;
		} else {
			break;
		}
	}
	cout << ans << endl;
	return 0;
}