#include<bits/stdc++.h>
using namespace std;
int main()
{
	int m,n;
	scanf("%d%d",&m,&n);
	int a[n+1][m+1],x[n+1];
	memset(a,0,sizeof(0));
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&x[i]);
		for(int j=0;j<=m;j++)
		{
			if(x[i]>j)a[i][j]=a[i-1][j];
			else a[i][j]=max(a[i-1][j],a[i-1][j-x[i]]+x[i]);
		}
	}
	printf("%d\n",m-a[n][m]);
	return 0;
}```