#include<bits/stdc++.h>

using namespace std;

int dp[1 << 14][200];
int mi[1 << 14][200];

int main()
{
    // O(N C 2^N)
    int c, n;
    cin >> c >> n;
    vector<int> w(n);
    for (int i = 0; i < n; ++i) {
        cin >> w[i];
    }
    for (int i = 0; i < (1 << n); ++i) {
        for (int j = 0; j < c; ++j) {
            mi[i][j] = 10000;
            dp[i][j] = 10000;
        }
    }
    dp[0][0] = 0;
    for (int i = 0; i < c; ++i)
        mi[0][i] = 0;

    for (int i = 1; i < (1 << n); ++i) {
        for (int j = 0; j < n; ++j) {
            if ((i >> j) & 1) {
                dp[i][0] = min(dp[i][0], mi[i ^ (1 << j)][c - w[j]] + 1);
                for (int k = w[j]; k < c; ++k)
                    dp[i][k] = min(dp[i][k], dp[i ^ (1 << j)][k - w[j]]);
            }
        }
        mi[i][0] = dp[i][0];
        for (int j = 1; j < c; ++j)
            mi[i][j] = min(mi[i][j - 1], dp[i][j]);
    }
    cout << (min(dp[(1 << n) - 1][0], mi[(1 << n) - 1][c - 1] + 1)) << "\n";

    return 0;
}