#include <iostream>
using namespace std;
int n, m, v[35], dp[20005];
int main(){
    cin >> m >> n;
    for (int i = 1;i <= n;i++) cin >> v[i];
    for (int i = 1;i <= n;i++)
		for (int j = m;j >= v[i];j--)
			dp[j] = max(dp[j], dp[j - v[i]] + v[i]);
    cout << dp[m];
}