#include<bits/stdc++.h>
using namespace std;
int n,V,ans,v[20005],a[20005],vis[20005];
void dfs(int s,int step){
	for (int i=1;i<=n;i++){
		if (vis[i]==0&&s+v[i]<=V){
			vis[i]=1;
			ans+=v[i];
			dfs(s+v[i],step+1);
			vis[i]=0;
		}
	}
	return ;
}
int main(){
    cin>>V>>n;
    for (int i=1;i<=n;i++) cin>>v[i];
    dfs(0,1);
    cout<<V-ans;
	return 0;
}