#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
using namespace std;

#define FOR(i,s,e) for(int i = (s);i <= (e);i++)

int L;
int N;
int W[10000];

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