#include <stdio.h>

int T, n, t[17];
int dp[1 << 17];

int min(int x, int y) {
  return x < y ? x : y;
}

int main(void) {
  scanf("%d %d", &T, &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &t[i]);
  }
  for (int i = 1; i < 1 << n; i++) {
    dp[i] = T + 1;
  }
  for (int k = 1;; k++) {
    for (int i = 0; i < 1 << n; i++) {
      for (int j = 0; j < n; j++) {
        if (~i >> j & 1) {
          dp[i | 1 << j] = min(dp[i | 1 << j], dp[i] + t[j]);
        }
      }
    }
    if (dp[(1 << n) - 1] <= T) {
      printf("%d\n", k);
      return 0;
    }
    for (int i = 0; i < 1 << n; i++) {
      dp[i] = dp[i] <= T ? 0 : T + 1;
    }
  }
}