#include <iostream>
#include <algorithm>

using namespace std;

int L, N, W[10000];
int main()
{
    cin >> L;
    cin >> N;



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

    sort(W, W + N);

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

    cout << ans << endl;
}