#include<ios>
using namespace std;
int ans=2e9,V[31],v,n;
inline void dfs(int now,int num){
ans=min(ans,now);
if(num==n+1)return;
if(now-V[num]>=0)dfs(now-V[num],num+1);
dfs(now,num+1);
}
main(){
scanf("%d%d",&v,&n);
for(int i=1;i<=n;++i)scanf("%d",V+i);
dfs(v,1);
printf("%d",ans);
}