#include<bits/stdc++.h>
using namespace std;
int n, ar[22], sz;
int solve(int idx, int rem) {
if (idx == sz)
return (n - rem);
int ret = 0;
ret = max(ret, solve(idx + 1, rem));
if (rem >= ar[idx])
ret = max(ret, solve(idx + 1, rem - ar[idx]));
return ret;
}
int main() {
while (cin >> n) {
cin >> sz;
for (int i = 0; i < sz; i++)
cin >> ar[i];
cout << solve(0, n) << "\n";
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBuLCBhclsyMl0sIHN6OwoKaW50IHNvbHZlKGludCBpZHgsIGludCByZW0pIHsKCWlmIChpZHggPT0gc3opCgkJcmV0dXJuIChuIC0gcmVtKTsKCWludCByZXQgPSAwOwoJcmV0ID0gbWF4KHJldCwgc29sdmUoaWR4ICsgMSwgcmVtKSk7CglpZiAocmVtID49IGFyW2lkeF0pCgkJcmV0ID0gbWF4KHJldCwgc29sdmUoaWR4ICsgMSwgcmVtIC0gYXJbaWR4XSkpOwoJcmV0dXJuIHJldDsKfQoKaW50IG1haW4oKSB7Cgl3aGlsZSAoY2luID4+IG4pIHsKCQljaW4gPj4gc3o7CgkJZm9yIChpbnQgaSA9IDA7IGkgPCBzejsgaSsrKQoJCQljaW4gPj4gYXJbaV07CgkJY291dCA8PCBzb2x2ZSgwLCBuKSA8PCAiXG4iOwoJfQoJcmV0dXJuIDA7Cn0=