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

int main(int argc, char** argv)
{
    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 sum = 0;
    int result = 0;
    for (result = 0; result < N; ++result)
    {
        if (sum + w[result] > L)
        {
            break;
        }
        sum += w[result];
    }
    std::cout << result;
    return 0;
}