#include <bits/stdc++.h>
using namespace std;

signed main() {
  ios::sync_with_stdio(false);

  int T;
  cin >> T;

  int N;
  cin >> N;

  vector<int> A(N);
  for (int i = 0; i < N; ++i) cin >> A[i];

  vector<vector<int>> dp(1 << N, vector<int>(N + 1, 0x3f3f3f3f));
  dp[0][0] = 0;
  for (int s = 0; s < 1 << N; ++s) {
    for (int i = 0; i < N; ++i) if (dp[s][i] <= T) dp[s][i + 1] = 0;
    for (int i = 0; i < N; ++i) {
      if (s >> i & 1) continue;
      for (int j = 0; j <= N; ++j)
        dp[s | 1 << i][j] = min(dp[s | 1 << i][j], dp[s][j] + A[i]);
    }
  }

  int all = (1 << N) - 1;
  int ans = find(dp[all].begin(), dp[all].end(), 0) - dp[all].begin();
  cout << ans << endl;
}