#define	_USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <set>
#include <complex>
#include <utility>
#include <numeric>
#define  rep(i,n) for(int i=0;i<(n);i++)
#define  REP(i,a,n) for(int i=a;i<(n);i++)
#define  rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define  VI	vector<int>
#define	 VS vector<string>
#define  all(a) (a).begin(),(a).end()
#define  debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
typedef pair<int,int> P;
typedef long long ll;

const int INF=1000000;
char field[101][101];
int d[101][101];
int N,M;
int sx,sy;
int gx,gy;

int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const int MAX_V=100;
const int MAX_N=100;
char o[3]={'+','-','*'};
bool f;

int main(){
	
	int l,n;
	cin>>l>>n;
	vector<int> w(n);
	
	rep(i,n)
		cin>>w[i];
	
	sort(w.begin(),w.end());
	
	int sum=0;
	int count=0;
	rep(i,n){
		if(sum+w[i]>l)
			break;
		else{
			sum+=w[i];
			count++;
		}
	}
	
	cout<<count<<endl;
	

	
}