#include <bits/stdc++.h>
using namespace std;
int v,a[50],n,ans;
void dfs(int x,int sum){
	if(x==n){
		ans=max(ans,sum);
		return;
	}
	if(x+1<=n and sum+a[x]<=v){
		dfs(x+1,sum+a[x]);
	}
	dfs(x+1,sum);
}
int main(){
	cin>>v>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	dfs(1,0);
	cout<<v-ans;
	return 0;
}