#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int N = 17, M = 1 << N, INF = 0x3f3f3f3f;

int n, lim;
int t[N], sum[M], dp[M];

void Solve() {
    scanf("%d%d", &lim, &n);

    for (int i = 0; i < n; ++i) scanf("%d", &t[i]);

    int full = 1 << n;
    sum[0] = 0;
    for (int mask = 1; mask < full; ++mask) {
        int bit = __builtin_ctz(mask);
        int prev = mask ^ (1 << bit);
        sum[mask] = sum[prev] + t[bit];
    }

    memset(dp, 0x3f, sizeof(dp));
    dp[0] = 0;
    for (int mask = 1; mask < full; ++mask) {
        if (sum[mask] <= lim) {
            dp[mask] = 1;
            continue;
        }
        for (int sub = mask; sub; sub = (sub - 1) & mask) {
            if (sum[sub] > lim) continue;
            int prev = mask ^ sub;
            if (dp[mask] > dp[prev] + 1) dp[mask] = dp[prev] + 1;
        }
    }

    printf("%d\n", dp[full - 1]);
}

int main() {
    Solve();

    return 0;
}