#include <bits/stdc++.h>

using namespace std;
long long C, H; // C容量，H捆
long long v[1010];//第i捆si体积
long long f[50010];
int main()
{
	scanf("%d%d", &C, &H);
	for (register int i = 1; i <= H; i++) {
		scanf("%d", &v[i]);
	}
	for (register int i = 1; i <= H; i++) {
		for (register int j = C; j >= v[i]; j--) {
			f[j] = max(f[j], f[j - v[i]] + v[i]);
		}
	}
	cout << f[C] << endl;
	return 0;
}

谢谢！