#include<bits/stdc++.h>
using namespace std;
const int M = 1000000007;

int main() {
    // O(3^n)
    int T, n;
    cin >> T >> n;
    vector<int> t(n);
    for (int i = 0; i < n; ++i) cin >> t[i];

    vector<int> dp(1 << n, n);
    dp[0] = 0;

    for (int i = 1; i < (1 << n); ++i) {
        int sum = 0;
        for (int j = 0; j < n; ++j)
            if ((i >> j) & 1)
                sum += t[j];

        if (sum <= T) {
            dp[i] = 1;
            continue;
        }
        for (int j = 0; ; j = (j - i) & i) {
            dp[i] = min(dp[i], dp[j] + dp[i ^ j]);
            if (i == j) break;
        }
    }
    cout << dp[(1 << n) - 1] << "\n";
    return 0;
}