#include <iostream>
#include <algorithm>

using namespace std;

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

    sort(W, W + N);
    for (int i = 1; i < N; i++) W[i] += W[i - 1];

    int ans = 0;
    for (int i = 0; i < N; i++) if (W[i] <= L) ans++;

    cout << ans << endl;
}