#include<iostream>
#include<cstdio>
#include<deque>
#include<algorithm>
#define LL long long
#define reint register int
using namespace std;
const int N=100005;
deque<LL>que;
LL b,s[N],cot[N],ans[N];int n,m,cnt;
void push(LL x){
    while(!que.empty()&&que.back()>=x)que.pop_back();
    que.push_back(x);return;
}
int main(){
    scanf("%d%d",&n,&m);push(n);
    for(reint i=1;i<=m;i++)
    scanf("%lld",&b),push(b);
    while(!que.empty())
        s[++cnt]=que.front(),que.pop_front();
    cot[cnt]=1;
    for(reint i=cnt-1;~i;i--){
        LL len=s[i+1];
        while(len>s[1]){
            reint pos=upper_bound(s+1,s+i+1,len)-s-1;
            cot[pos]+=len/s[pos]*cot[i+1];
            len%=s[pos];
        }ans[len]+=cot[i+1];
    }
    for(reint i=s[1];i;i--)ans[i]+=ans[i+1];
    for(reint i=1;i<=n;i++)printf("%lld\n",ans[i]);
    return 0;
}