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

int main() {
    int L, N;
    cin >> L;
    cin >> N;
    vector<int> W(N);
    for (int i = 0; i < N; ++i) cin >> W[i];

    sort(W.begin(), W.end());

    int sum = 0, cnt = 0;
    for (int i = 0; i < N; ++i) {
        sum += W[i];
        if (sum <= L) {
            ++cnt;
        } else {
            break;
        }
    }

    cout << cnt << endl;
}