#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int T, n; cin >> T >> n;
  vector<int> t(n); REP(i, n) cin >> t[i];
  vector<bool> spend(1 << n);
  REP(i, 1 << n) {
    int tm = 0;
    REP(j, n) {
      if (i >> j & 1) tm += t[j];
    }
    spend[i] = tm <= T;
  }
  vector<int> dp(1 << n, n);
  dp[0] = 0;
  REP(i, 1 << n) {
    int j = ((1 << n) - 1) ^ i, sub = j;
    do {
      if (spend[sub]) chmin(dp[i | sub], dp[i] + 1);
    } while ((sub = (sub - 1) & j) != j);
  }
  cout << dp[(1 << n) - 1] << '\n';
  return 0;
}