AC

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {

int C, H;
cin >> C >> H;
vector<int> V(H);
for (int i = 0; i < H; ++i) {
    cin >> V[i];
}

vector<int> dp(C + 1, 0);
for (int i = 0; i < H; ++i) {
    for (int j = C; j >= V[i]; --j) {
        dp[j] = max(dp[j], dp[j - V[i]] + V[i]);
    }
}

cout << dp[C] << endl;
return 0;

}