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

int L, N;
int W[10010];

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