#include <bits/stdc++.h>
using namespace std;
int dp[2000010], a[20], k, n;
int main(){
cin >> k >> n;
for (int i=1; i<=n; i++) cin >> a[i];
memset(dp, 0x3f3f3f3f, sizeof(dp));
dp[0] = 0;
for (int i=1; i<=n; i++){
for (int j=0; j<=2000000; j++){
if (j>=a[i] && dp[j-a[i]]+1<=k){
dp[j] = min(dp[j], dp[j-a[i]]+1);
}
}
}
int s=0;
for (int i=0; i<=2000000; i++){
if (dp[i] == 0x3f3f3f3f || dp[i] > k){
s=i-1;
break;
}
}
cout << s;
return 0;
}