#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int INF = (int)1e9 + 7;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int main() {
    int t, n; cin >> t >> n;
    vector<int> a(n);
    for (auto &ai: a) cin >> ai;
    vector<int> dp(1 << n, INF);
    for (int mask = 0; mask < 1 << n; mask++) {
        int sum = 0;
        for (int i = 0; i < n; i++) if (mask >> i & 1) sum += a[i];
        if (sum <= t) dp[mask] = 1;
    }
    for (int mask = 0; mask < 1 << n; mask++) {
        for (int sub = mask; sub; sub = (sub - 1) & mask) {
            chmin(dp[mask], dp[sub] + dp[mask ^ sub]);
        }
    }
    cout << dp[(1 << n) - 1] << endl;
    return 0;
}