#include <iostream>
#include <vector>
using namespace std;

const int INF = 1<<29;
int N, T;
vector<int> t;
vector<vector<int> > dp;

int main() {
    cin >> T >> N;
    t.resize(N); for (int i = 0; i < N; ++i) cin >> t[i];
    dp.assign(N+1, vector<int>((1<<N)+1, INF));
    dp[0][0] = 0;
    for (int k = 0; k < N; ++k) {
        for (int bit = 0; bit < (1<<N); ++bit) {
            if (dp[k][bit] <= T) dp[k+1][bit] = 0;
            for (int i = 0; i < N; ++i) {
                if (bit & (1<<i)) continue;
                int nbit = bit | (1<<i);
                dp[k][nbit] = min(dp[k][nbit], dp[k][bit] + t[i]);
                if (dp[k][nbit] + t[i] <= T) dp[k+1][nbit] = 0;
            }
        }
    }
    int res = N;
    for (int k = 0; k < N; ++k) if (dp[k][(1<<N)-1] == 0) res = min(res, k);
    cout << res << endl;
}