#include <iostream>
#include <vector>

using namespace std;

int main() {
    int L, N, ans = 0;
    vector<int> W;
    cin >> L;
    cin >> N;

    while (N--) {
        int a;
        cin>>a;
        W.push_back(a);
    }

    for (int i=0; i<W.size(); i++){
        for (int j= W.size() - 1; j > i; j--) {
            if (W[i] > W[j]){
                int t = W[i];
                W[i] = W[j];
                W[j] = t;
            }
        }
    }

    for (int i=0; i<W.size(); i++) {
        if (L >= W[i]) {
            L -= W[i];
            ans++;
        }
    }



    cout<<ans<<endl;
    return 0;
}