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

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

    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;
    std::sort(xs.begin(), xs.end());

    int ans = 0;
    for (auto x : xs) {
        l -= x;
        if (l < 0) break;
        ++ans;
    }

    std::cout << ans << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}