#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int L, N;
    vector<int> W;
    cin >> L;
    cin >> N;
    for (int i = 0; i < N; i++)
    {
        int tmp;
        cin >> tmp;
        W.push_back(tmp);
    }
    sort(W.begin(), W.end());
    int sum = 0;
    int ans = 0;
    for (int i = 0; i < N; i++)
    {
        if (sum + W[i] > L)
        {
            break;
        }
        sum += W[i];
        ans++;
    }
    cout << ans << endl;
    return 0;
}