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

int main() {
    int l, n;
    int c = 0;
    std::vector<int> w;
    std::cin >> l >> n;
    w.resize(n);
    for (int i = 0; i < n; i++) {
        std::cin >> w[i];
    }
    std::sort(w.begin(), w.end());
    for (int i = 0; i < n; i++) {
        l -= w[i];
        if (l < 0) {
            break;
        }
        c++;
    }
    std::cout << c << std::endl;
}