#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
} 

ll modpow(ll a,ll n, ll mod) {
  ll res = 1;
  while (n > 0) {
      if (n & 1) res = res * a % mod;
      a = a * a % mod;
      n >>= 1;
  }
  return res;
}
ll solve(ll n,vl v,ll m){
    vl idx(1<<n);
    repl(bit,1,1<<n){
        ll p=__builtin_ctz(bit);
        idx[bit]=idx[bit^(1<<p)]+v[p];
    }
  	vl precalc=idx;
    idx.push_back(0);
    sort(all(idx));
    ll ok=1<<n,ng=0;
    while(ok-ng>1){
        ll mod=MOD;
        ll mid=(ok+ng)>>1;
        vl ind(1<<n);
        rep(bit,1<<n){
            if(precalc[bit]<=idx[mid])ind[bit]++;
        }
        rep(i,n){
            rep(bit,1<<n){
                if(bit>>i&1)continue;
                ind[bit|(1<<i)]+=ind[bit];
            }
        }
        ll g=0;
        rep(bit,1<<n){
            ll ret=modpow(ind[bit],m,mod);
            if((n-__builtin_popcount(bit))&1)g-=ret;
            else g+=ret;
          	if(g<0)g+=mod;
          	if(g>=mod)g-=mod;
        }
        if(g)ok=mid;
        else ng=mid;
    }
    return idx[ok];
}
int main(){
    ll t;cin >> t;
    ll n;cin >> n;
    vl v(n);rep(i,n)cin >> v[i];
    for(ll m=1;m<=n;m++){
        if(solve(n,v,m)<=t){
            cout << m << endl;return 0;
        }
    }
}