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

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

    vector<vector<int>> dp(1 << n, vector<int>(n + 1, M));
    for (int i = 0; i < n + 1; ++i) dp[0][i] = 0;

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