#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int T, N, t[20];
int dp[1<<17];

int cnt_bit(int m){
    int ans = 0;
    for(int i = 0; i < N; i++){
        if(m&(1<<i)) ans++;
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> T >> N;
    for(int i = 0; i < (1<<N); i++) dp[i] = 30;
    
    for(int i = 0; i < N; i++) cin >> t[i];
    for(int i = 0; i < N; i++){
        dp[1<<i] = 1;
    }
    for(int i = 1; i < (1<<N); i++){
        int sum = 0;
        for(int j = 0; j < N; j++){
            if(i&(1<<j)) sum += t[j];
        }
        if(sum <= T) dp[i] = 1;
    }
    for(int i = 1; i < (1<<N); i++){
        if(cnt_bit(i) <= 1) continue;
        for(int j = (i-1)&i; j >= 1; j = (j-1)&i){
            int m = i-j;
            dp[i] = min(dp[i], dp[j]+dp[m]);
        }
    }
    cout << dp[(1<<N)-1] << endl;
}