Snuke got an integer sequence from his mother, as a birthday present. The sequence has N elements, and the i-th of them is i. Snuke performs the following Q operations on this sequence. The i-th operation, described by a parameter q_i, is as follows:

* Take the first q_i elements from the sequence obtained by concatenating infinitely many copy of the current sequence, then replace the current sequence with those q_i elements.



After these Q operations, find how many times each of the integers 1 through N appears in the final sequence.

Constraints

* 1 ≦ N ≦ 10^5
* 0 ≦ Q ≦ 10^5
* 1 ≦ q_i ≦ 10^{18}
* All input values are integers.

Input

The input is given from Standard Input in the following format:


N Q
q_1
:
q_Q


Output

Print N lines. The i-th line (1 ≦ i ≦ N) should contain the number of times integer i appears in the final sequence after the Q operations.

Examples

Input

5 3
6
4
11


Output

3
3
3
2
0


Input

10 10
9
13
18
8
10
10
9
19
22
27


Output

7
4
4
3
3
2
2
2
0
0
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
long long n,N,i,x,Q,p,l,r,last,j;
long long a[100008],b[100008];
long long q[100008][60][2];
long long ans[100008];
int main()
{
	scanf("%lld %lld",&N,&Q);
	a[n=1]=N;
	for(i=1;i<=Q;i++)
	{
		scanf("%lld",&x);
		while(a[n]>=x)n--;
		a[++n]=x;
	}
	q[1][0][1]=a[1];
	for(i=2;i<=n;i++)
	{
		p=a[i];last=i-1;
		while(p>=a[1])
		{
			l=1;r=last;
			while(l!=r)
			{
				if(a[(l+r+1)/2]<=p)l=(l+r+1)/2;
				else r=(l+r+1)/2-1;
			}
			q[i][++q[i][0][0]][0]=l;
			q[i][q[i][0][0]][1]=p/a[l];
			p=p%a[l];last=l;
		}
		q[i][0][1]=p;
	}
	b[n]=1; 
	for(i=n;i>=1;i--)
	{
		for(j=1;j<=q[i][0][0];j++)
		  b[q[i][j][0]]+=q[i][j][1]*b[i];
		ans[q[i][0][1]]+=b[i];
	}
	for(i=N;i>=1;i--)
	  ans[i]+=ans[i+1];
	for(i=1;i<=N;i++)
	  printf("%lld\n",ans[i]); 
	return 0;
} 
/*
10 10
9
13
18
8
10
10
9
19
22
27
 
8
9
19
22
27
*/