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

int main() {
    int t,n;
    std::cin >> t >> n;
    int nn;
    std::vector<int> v;
    for (int i=0;i<n;i++) {
        std::cin >> nn;
        v.push_back(nn);
    }
    std::sort(v.begin(),v.end(),[](const int x, const int y){return x>y;});

    std::vector<int> ans;
    for (auto c : v) {
        for (auto s : ans) {
            if (t>=c+s) {
                s+=c;
                c=0;
                break;
            }
        }
        if (c!=0) ans.push_back(c);
    }
    std::cout << ans.size() << std::endl;
}