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

int main(void) {
  constexpr int inf = 987'654'321;
  int T, N; scanf("%d%d", &T, &N);
  vector<int> t(N);
  for(int i=0; i<N; ++i) { scanf("%d", &t[i]); }
  // dp[問題の集合] := 最小人数
  vector<int> dp(1<<N, inf);
  for(int S0=0; S0<1<<N; ++S0) {
    int acc = 0;
    for(int i=0; i<N; ++i) {
      if(S0 >> i & 1) { acc += t[i]; }
    }
    if(acc <= T) { dp[S0] = 1; }
  }
  for(int S0=0; S0<1<<N; ++S0) {
    for(int T0=S0; T0; T0=--T0 & S0) {
      dp[S0] = min(dp[S0], dp[S0 & ~T0] + dp[T0]);
    }
  }
  int res = dp[(1<<N)-1];
  printf("%d\n", res);
  return 0;
}