#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int L, N;
    int w;
    vector<int> W;
    cin >> L >> N;
    for (int i = 0; i < N; i++) {
        cin >> w;
        W.push_back(w);
    }
    std::sort(W.begin(), W.end());
    int ans = 0;
    for (int i = 0; i < W.size(); i++) {
        L -= W.at(i);
        if (L >= 0) {
            ans++;
        } else {
            break;
        }
    }
    cout << ans << endl;

    return 0;
}