#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
constexpr int N = 20000 + 10, inf = 0x3f3f3f3f;
int n, m, num1, num2;
int a[N];
int dp[35][N];
// 当物品为i,背包容量为j的时候最多可以装下多少物品;
void solve()
{
int m, n;
cin >> m >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
int res = inf;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
if (a[i] <= j)
{
dp[i][j] = max(dp[i - 1][j - a[i]] + a[i], dp[i - 1][j]);
}
else
{
dp[i][j] = dp[i - 1][j];
}
}
}
cout << m - dp[n][m];
}
signed main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int T = 1;
while (T--)
{
solve();
}
return 0;
}