#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<string>
using namespace std;
int main(){
    long long L,N,x,i;
    vector<long long> vc;
    cin >> L >> N;
    while(N--){
        cin >> x;
        vc.push_back(x);
    }
    sort(vc.begin(),vc.end());
    if(vc[0]<=L)
    for(i=1;i<vc.size()-1;i++){
        L-=vc[i];
        if(vc[i+1]<=L)  break;
    }
    cout << i;
    return 0;
}