#include<bits/stdc++.h>
using namespace std;
int a[100]={0};
int w;
int xz(int n,int x)
{
    if(n==0)
    {
        return x;
    } 
    if(x+a[n]<=w)
    {
        return max(xz(n-1,x+a[n]),xz(n-1,x));
    }
    else
    {
        return xz(n-1,x);
    }
}
int main()
{
    freopen("giftgiving.in","r",stdin);
    freopen("giftgiving.out","w",stdout);
    int n,ans,b,i,j;
    cin>>w>>n;
    b=0;
    for(i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    ans=xz(n,0);
    cout<<ans;
    return 0;
}