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

int main(){
    int C,N;
    cin>>C>>N;
    vector<int> W(N);
    for(auto &w:W)cin>>w;
    int DP[(1<<N)-1];
    DP[0]=0;
    for(int b=1;b<(1<<N);b++){
        int w=0;
        for(int k=0;(1<<k)<=b;k++){
            if(b&(1<<k))w+=W[k];
        }
        if(w<=C){
            DP[b]=1;
        }else{
            DP[b]=16;
        }
    }
    for(int k=1;k<=N;k++){
        //nCkを列挙
        int comb = (1<<k) -1;
        while(comb<1<<N){
            for(int b=0;b<(1<<(N-k));b++){
                int B=comb,co=0,bb=b;
                for(int bb=b;bb;bb>>=1){
                    if(bb&1)co|=~B&-~B;
                    B|=~B&-~B;
                }
                DP[comb|co]=min(DP[comb|co],DP[comb]+DP[co]);
            }

            int x=comb&-comb, y=comb+x;
            comb = ((comb&~y)/x>>1)|y;
        }
    }
    // for(int i=0;i<(1<<N);i++) cout<<static_cast<std::bitset<6> >(i)<<' '<<DP[i]<<endl;
    cout<<DP[(1<<N)-1]<<endl;

    return 0;
}