#include <fstream>
#include <queue>
#define nmax 25

using namespace std;

ifstream in("light2.in");
ofstream out("light2.out");

long long D[nmax];
int V[nmax];

class cmp
{
    public:
    inline bool operator()(int a,int b){return D[a]>D[b];}
};


priority_queue<int,vector<int> ,cmp>H;

int cmmdc(int a,int b)
{
    int r;
    while(b)
    {
        r=a%b;
        a=b;
        b=r;
    }
    return a;
}

int main()
{
    int N,K,i;
    in>>N>>K;
    for(i=1;i<=K;i++)
    {
        in>>V[i];
        D[i]=V[i];
        H.push(i);
        //div=cmmdc(CMMMC,V[i]);
        //CMMMC=*V[i]/div;
    }
    int nr=0,n_bec=0,nr_ant=-1,p;
    bool aprins=0;
    while(nr<=N)
    {
        p=H.top();
        H.pop();
        nr=D[p];
        if(nr>N)continue;
        D[p]+=V[p];
        H.push(p);
        if(nr_ant==nr&&aprins==1)
            n_bec--,aprins=0;
        else if(nr_ant==nr&&aprins==0)
            n_bec++,aprins=1;
        else n_bec++,aprins=1;
        nr_ant=nr;
    }
    out<<n_bec;
    return 0;
}