#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int L;
    cin >> L;

    int N;
    cin >> N;

    int W = 0;
    vector<int> W_N;
    for (int i = 0; i < N; i++) {
        cin >> W;
        W_N.push_back(W);
    }
    sort(W_N.begin(), W_N.end());

    int answer = 0;
    for (int i = 0; i < N; i++) {
        L -= W_N[i];
        if (L < 0) {
            break;
        }
        answer += 1;
    }
    cout << answer << endl;
}