#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

const ll INF = 1e18;
const ll MOD = 1e9 + 7;

template<typename T> T chmax(T& a, const T& b){return a = (a > b ? a : b);}
template<typename T> T chmin(T& a, const T& b){return a = (a < b ? a : b);}

int main(){
    int t, n;
    cin >> t >> n;
    vi a(n);
    rep(i, n) cin >> a[i];
    vi dp(1<<n, 1e9);
    dp[0] = 0;
    REP(mask, 1, 1<<n) {
        int sum = 0;
        rep(i, n) if(mask&(1<<i)) sum += a[i];
        if(sum <= t) dp[mask] = 1;
    }
    REP(mask, 1, 1<<n) {
        for(int A = mask-1; A > 0; A=(A-1)&mask) {
            int B = mask - A;
            chmin(dp[mask], dp[A]+dp[B]);
        }
    }
    cout << dp[(1<<n)-1] << '\n';
    return 0;
}