#include <iostream>
#include <algorithm>
using namespace std;
const int N = 33;
int v[N];
int n, m;
int f(int u, int vv){
if (u > n) return vv;
if (vv >= v[u])
return min(f(u + 1, vv - v[u]), f(u + 1, vv));
else return f(u + 1, vv);
}
int main(){
scanf("%d%d", &m, &n);
for (int i = 1; i <= n; i ++)
scanf("%d", &v[i]);
int res = f(1, m);
printf("%d\n", res);
return 0;
}