#include "iostream"
using namespace std;
#define INF 0x7ffffff 
#define size 2000001
int dp[size];
int main()
{
    int k, n, vlaue[51], i, j;
    cin>>k>>n;
    for(i=0; i<n; i++) cin>>vlaue[i];
    dp[0] = 0;
    for(i=1; i<size; i++)
    {
        dp[i] = INF;
        for(j=0; j<n; j++)
            if(vlaue[j]<=i) dp[i]=min(dp[i], dp[i-vlaue[j]]+1); //i就是要實現的面值，只有當dp[i-value[j]]已經被鋪墊之后，dp[]才會結束。
        if(dp[i]>k) break;
    }
    cout<<i-1<<endl;
    return 0;
}