#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <cstring>
#include <sstream>
#include <cmath>
#include <limits>
#include <algorithm>
#include <iterator>
#include <memory.h>
#include <time.h>

using namespace std;

typedef unsigned long long ULL;
typedef long long LL;

#define CUR_NAMESPACE namespace diet {
CUR_NAMESPACE

const int N = 505;
const int C = 45005;

class Solver
{
private:
	int c, n;
	int values[N];
	int dp[C];
public:
	void Solve()
	{
		scanf("%d%d", &c, &n);
		for (int i = 0; i < n; i++) {
			scanf("%d", &values[i]);
		}
		for (int i = 0; i < n; i++) {
			for (int j = c; j >= values[i]; j--) {
				dp[j] = max(dp[j], dp[j - values[i]] + values[i]);
			}
		}
		printf("%d\n", dp[c]);
	}
} solver;

void Launch()
{
	solver.Solve();
}

#define NAMESPACE_END }
NAMESPACE_END

int main()
{
    freopen("diet.in", "r", stdin);
	freopen("diet.out", "w+", stdout);
	diet::Launch();
	return 0;
}