#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>

using namespace std;

int main() {

    int L;
    int N;
    cin >> L >> N;
    vector<int> ws;
    for (int i = 0; i < N; ++i) {
        int W;
        cin >> W;
        ws.push_back(W);
    }

    sort(ws.begin(), ws.end());
    int cnt = 0;
    for (int i = 0; i < N; ++i) {
        if (L - ws[i] >= 0) {
            L -= ws[i];
            cnt += 1;
        } else {
            break;
        }
    }

    cout << cnt << endl;

    return 0;

}