#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <functional>
#include <tuple>
#include <climits>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>

using namespace std;

int main()
{
    int L, N;
    cin >> L >> N;
    vector<int> W(N);
    for(auto &w : W) cin >> w;
    std::sort(W.begin(), W.end());
    int count = 0;
    int total = 0;
    while(count < N) {
        if(total + W[count] <= L) {
            total += W[count];
            count++;
        } else {
            break;
        }
    }
    cout << count << endl;
}