#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
    long long l = 0;
    long long m = 0;
    int n;
    long long count = 0;
    long long *w;
    cin >> l;
    cin >> n;
    w = new long long[n];
    for(int i = 0; i < n; ++i){
        cin >> w[i];
    }
    sort(w,w+n);
    for(int i = 0; i < n; ++i){
        l -= w[i];
        if(l<=0){break;}
        count++;
    }
    cout << count << "\n";
    return 0;
}