#include<bits/stdc++.h>
#define ll long long
using namespace std;
int w,n,g[49],l,r;
ll ans,maxx;
vector<ll> a,b;
void dfs1(int l,int r,ll sum){
	if(l>r){
		if(sum<=w) a.push_back(sum);
		return ;
	}
	dfs1(l+1,r,sum+g[l]);
	dfs1(l+1,r,sum);
}
void dfs2(int l,int r,ll sum){
	if(l>r){
		if(sum<=w) b.push_back(sum);
		return ;
	}
	dfs2(l+1,r,sum+g[l]);
	dfs2(l+1,r,sum);
}
int main(){
	freopen("giftgiving.in","r",stdin);
	freopen("giftgiving.out","w",stdout);
	cin>>w>>n;
	for(int i=1;i<=n;i++) cin>>g[i];
	dfs1(1,(n+1)/2,0);
	dfs2((n+1)/2+1,n,0);
	sort(b.begin(),b.end());
	for(int i=0;i<a.size();i++){
		l=0,r=b.size()-1,ans=0;
		while(l<=r){
			int mid=(l+r)/2;
			if(a[i]+b[mid]<=w){
				l=mid+1;
				ans=mid;
			}else r=mid-1;
		}
		maxx=max(maxx,a[i]+b[ans]);
	}
	cout<<maxx<<endl;
	return 0;
}