#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

int main() {
    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);
    dp[0] = 0;
    for (int k = 1; k < 1 << n; k++) {
        int x = 1 << 30;
        for (int i = 0; i < n; i++) {
            int l = k ^ 1 << i;
            if (l < k) {
                int a = dp[l] + t[i];
                int b = a & 0xffff;
                if (b >= T) a = (dp[l] & ~0xffff) + 0x10000 + (b > T) * t[i];
                x = min(x, a);
            }
        }
        dp[k] = x;
    }

    cout << ((dp[(1 << n) - 1] + 0xffff) >> 16) << endl;

    return 0;
}