#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 20010, M = 32;
int f[N];
int v[M];
int n, m;
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--)
f[j] = max(f[j], f[j - v[i]] + v[i]);
int ans = m - f[m];
cout << ans << endl;
return 0;
}