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

int main()
{
    vector<int> W;
    int L, N;
    cin >> L >> N;

    for (int i = 0; i < N; i++)
    {
        int Wi;
        cin >> Wi;
        W.push_back(Wi);
    }
    sort(W.begin(), W.end());

    for (int i = 0; i <= N; i++)
    {
        if (W[i] > L || i == N)
        {
            cout << i << endl;
            break;
        }
        L -= W[i];
    }

    return 0;
}