#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;

int N, L;

int main()
{
    cin >> L >> N;
    vector<int> w(N);
    for (int i = 0; i < N; i++)
    {
        cin >> w[i];
    }
    int s = 0, ans = 0;
    sort(w.begin(), w.end());
    for (int i = 0; i < N; i++)
    {
        if (s + w[i] <= L)
            s += w[i], ans++;
    }
    cout << ans << endl;
}