#include <bits/stdc++.h>
using namespace std;

int main() {
    int L, N, W[10010];
    cin >> L >> N;
    for (int i = 0; i < N; i++)
        cin >> W[i];
    sort(W, W + N);
    int ans = 0;
    while (ans < N) {
        if (L < W[ans])
            break;
        L -= W[ans];
        ans++;
    }
    cout << ans << endl;
}