#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
    os<<p.first<<" "<<p.second;
    return os;
}

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==v.size()?"":" ");
    return os;
}

int dp[1<<18];
int t[18];
int n;
int T;

int DP(int bit){
    if(dp[bit]>=0) return dp[bit];
    int res=INF;
    int subset=bit;
    do{
        if(subset!=bit){
            int sum=0;
            rep(i,n){
                if(((bit>>i)&1) and !((subset>>i)&1)) sum+=t[i];
            }
            if(sum<=T){
                chmin(res,1+DP(subset));
            }
        }
        subset=(subset-1)&bit;
    }while(subset!=bit);
    return dp[bit]=res;
}

signed main(){
    cin>>T;
    cin>>n;
    rep(i,n) cin>>t[i];
    rep(i,1<<n)dp[i]=-1;
    dp[0]=0;
    cout<<DP((1<<n)-1)<<endl;
    return 0;
}