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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int L, n;
        cin >> L >> n;

        vector<int> w(n);
        for (int i = 0; i < n; i++) {
            cin >> w[i];
        }

        vector<int> dp(L + 1);

        for (auto w : w) {
            for (int i = L; i >= w; i--) {
                dp[i] = max(dp[i], dp[i - w] + 1);
            }
        }

        cout << dp.back() << '\n';
    };
    
    solve();
    
    return 0;
}