#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm> 
using namespace std;
using ll=long long;

int main()
{   
    ll L;
    ll N;
    cin >> L >> N;
    vector<ll> W(N);
    for(ll i=0;i<N;i++){
        cin >> W[i];
    }
    sort(W.begin(),W.end());
    ll res=0;
    for(ll i=0;i<N;i++){
        L-=W[i];
        if(L<0){
            break;
        }
        res++;
    }
    cout << res << endl;
}