#include<iostream> #include<algorithm> using namespace std; int a[50]; int v,n; int min_space_last; void s(int step,int ls){ if(step == n){ min_space_last = min(min_space_last,ls); return; } s(step+1,ls); if(ls >= a[step]){ s(step+1,ls-a[step]); } } int main(){ cin>>v>>n; min_space_last = v; for(int i = 0; i < n; i++){ cin>>a[i]; } s(0,v); cout<<min_space_last; return 0; }