#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const int INF=1e7;
int dp[1<<17];
int n, T;
int t[17];
int s1, s2, i1, i2;
void solve(int i){
  if(i==n){
    if(i1==0 || i2==0) return;
    dp[i1+i2]=min(dp[i1+i2], dp[i1]+dp[i2]);
    return;
  }
  solve(i+1);
  i1+=(1<<i);
  //s1+=t[i];
  solve(i+1);
  i1-=(1<<i);
  //s1-=t[i];
  i2+=(1<<i);
  //s2+=t[i];
  solve(i+1);
  i2-=(1<<i);
}

int main()
{
  
  cin>>T; cin>>n;
  
  int sum=0;
  for(int i=0; i<n; i++){
    cin>>t[i];
    sum+=t[i];
  }
  if(sum<=T){
    cout<<1<<endl;
    return 0;
  }
  
  for(int i=1; i<(1<<n); i++){
    int s=0;
    for(int j=0; j<n; j++){
      if(i&(1<<j)) s+=t[j];
    }
    if(s<=T) dp[i]=1;
    else dp[i]=INF;
  }
  solve(0);
  cout<<dp[(1<<n)-1]<<endl;
	return 0;
}