#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int n,m,p;
long long x[100010],f[100010],s[100010];
int main()
{
	//freopen("sequence.in","r",stdin);
	//freopen("sequence.out","w",stdout);
	int i,j;
	long long k;
	scanf("%d%d",&n,&m);
	p=1;
	x[1]=n;
	while(m--)
	  {
       scanf("%lld",&k);
       while(x[p]>=k)
         p--;
       x[++p]=k;
      }
    f[p]=1;
    for(i=p;i>0;i--)
      {
       k=x[i];
       while(1)
         {
          j=upper_bound(x+1,x+i,k)-x-1;
          if(!j)
            break;
          f[j]+=k/x[j]*f[i];
          k%=x[j];
         }
       s[k]+=f[i];
      }
    for(i=n;i>0;i--)
      s[i]+=s[i+1];
    for(i=1;i<=n;i++)
      printf("%lld\n",s[i]);
	return 0;
}
