#include <bits/stdc++.h>
using namespace std;

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

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

    int width = 0;
    for (int i = 0; i < N; ++i){
        width += W[i];
        if (L < width){
            cout << i << endl;
            return 0;
        }
    }

    cout << W.size() << endl;

    return 0;
}