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

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

    std::vector<int> w(n);
    for (int i = 0; i < n; i++) {
        std::cin >> w[i];
    }
    
    std::sort(w.begin(),w.end());
    
    int ans = 0;
    int sum = 0;
    for (int k = 0; k < n ; k++) {
        sum += w[k];
        if (sum <= l) ans++;
        else break;
    }

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

    return 0;
}