#include<iostream>
#include<cstring>
#define int long long
using namespace std;
const int N = 1e7 + 5;
const int INF = 1e12;
int k, n, a[N], dp[N], maxn, maxx;
signed main () {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> k >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		maxx = max(maxx, a[i]);
		dp[i] = INF;
	}
	dp[0] = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = a[i]; j <= k * maxx; j++) {
			if (dp[j - a[i]] + 1 <= k) {
				dp[j] = min(dp[j], dp[j - a[i]] + 1);
			}
		}
	}
	for (int i = 1; ; i++) {
		if (dp[i] != INF) {
			maxn = i;
		}
		else {
			break;
		}
	}
	cout << maxn;
	return 0;
}