#include<bits/stdc++.h>

#define ll long long

#define rep(i,a,b) for(int i=a;i<=b;i++)

using namespace std;

const int maxn=;

const ll inf=1LL<<;

ll a[maxn],b[maxn];

int main()

{

    int N,D;ll ans;

    while(~scanf("%d%d",&N,&D)&&(N||D)){

        ans=;

        rep(i,,D) scanf("%lld",&a[i]);

        sort(a+,a+D+);

        rep(i,,D) b[i]=a[i];

        rep(i,,N)  b[i+D]=inf;

        rep(i,,N) ans+=b[i];

        while(){

            rep(i,,D) b[i+N]=b[]+a[i];

            b[]=b[N+D];

            sort(b+,b+N+D);

            ll sum=;

            rep(i,,N) sum+=b[i];

            if(sum<ans) ans=sum;

            else break;

        }

        printf("%lld\n",ans);

    }

    return ;

}