#include <iostream>
#include <vector>
#include <algorithm>


using namespace std;

int main() {
    int l, n;
    vector<int> w;
    
    cin >> l >> n >> std::ws;
    
    int tmp;
    for (int i = 0; i < n; i++) {
        cin >> tmp >> std::ws;
        w.push_back(tmp);
    }
    
    sort(w.begin(), w.end());
    
    int ct;
    for (int j = 0; j < n; j++) {
        l -= w[j];
        if (l < 0) {
            break;
        } else {
            ct++;
        }
    }
    
    cout << ct << endl;
    
    return 0;
}