#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <array>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <math.h>

using namespace std;

int main() {

    int L;
    int N;
    cin >> L;
    cin >> N;
    vector<int> v(N);
    int w;
    for (int i = 0; i < N; ++i) {
        cin >> w;
        v[i] = w;
    }

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

    int result = 0;

    for (int j = 0; j < N; ++j) {
        if ((L - v[j]) >= 0) {
            L -= v[j];
            result += 1;
        } else {
            result = j;
            break;
        }
    }

    cout << result << "\n";
}