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

int main(void) {
    int L, N;
    cin >> L >> N;
    int W[N];
    for (int i = 0; i < N; i++) {
        cin >> W[i];
    }
    sort(W, W + N);
    int boxes = 0;
    for (int i = 0; i < N; i++) {
        boxes += W[i];
        if (boxes > L) {
            cout << i << endl;
            return 0;
        }
    }
    cout << N << endl;
    return 0;
}