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

int main() {
    int l, n;
    std::cin >> l >> n;

    std::vector<int> w(n);
    for (auto& wn : w) {
        std::cin >> wn;
    }
    std::sort(std::begin(w), std::end(w));

    int len = 0;
    for (std::size_t i = 0; i < w.size(); ++i) {
        
        len += w[i];
        if (len > l) {
            std::cout << i << std::endl;
            return 0;
        }
    }
    std::cout << n << std::endl;
}