#include <algorithm>
#include <numeric>
#include <string>
#include <vector>
#include <iostream>
#include <queue>
#include <utility>
#include <cmath>
using namespace std;

using ull = unsigned long long;

int main()
{
    int l,n;
    cin >> l >> n;
    vector<int> w(n);

    for(auto&& x : w) cin >> x;

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

    int count = 0;
    for(auto&& x : w)
    {
        if(l-x >= 0)
        {
            l -= x;
            ++count;
        }
    }

    cout << count << endl;
}