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

#define REP(i,n) for (int i = 0;i < (n); i++)

int main()
{
    int L, N;
    cin >> L >> N;
    vector<int> Wi(N);
    
    REP(i, N) {
        cin >> Wi[i];
    }
    sort(Wi.begin(), Wi.end());
    
    int count = 0;
    REP(i, N) {
        if (L >= Wi[i]) {
            L -= Wi[i];
            count++;
        }
        else break;
    }
    cout << count << endl;
    
    return 0;
}