#include <bits/stdc++.h>
using namespace std;
const int N=45+5;
typedef long long ll;
int n;
ll g[N],w,ans=0,qzh[N]={0};
void dfs(int pt,ll num){
    if (num<0)return ;
    if (num-qzh[pt]>=0){
        ans=max(ans,w-num+qzh[pt]);
        return ;
    }
    if (pt==0){
        ans=max(ans,w-num);
        return ;
    }
    dfs(pt-1,num);
    dfs(pt-1,num-g[pt]);
    return ;
}
int main(){
    freopen ("giftgiving.in","r",stdin);
    freopen ("giftgiving.out","w",stdout);
    scanf("%lld%d",&w,&n);
    for (int i=1;i<=n;i++){
        scanf("%lld",&g[i]);
        
    }
    sort(g+1,g+n+1);
    for (int i=1;i<=n;i++)qzh[i]=qzh[i-1]+g[i];
    dfs(n,w);
    printf("%lld\n",ans);
    return 0;
}