#include <bits/stdc++.h>
using namespace std;
int L, N, W[10001];
int main() {
    scanf("%d %d", &L, &N);
    for (int i = 1; i <= N; ++ i) scanf("%d", &W[i]);
    sort(W + 1, W + N + 1);
    int sum = 0, ans = 0;
    for (int i = 1; i <= N; ++ i) {
        if (sum + W[i] <= L) sum += W[i], ans ++;
        else break;
    }
    printf("%d\n", ans);
    return 0;
}