#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000

using namespace std;
typedef long long ll;

const int MAXN = 10100;
int w[MAXN];

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