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<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 100010
#define ll long long
using namespace std;
int n,m;
ll delta[N],f[N];
ll ton[N];
int top;
void work(ll x,ll y)
{
    if(!x) return;
    int pos=upper_bound(ton+1,ton+1+top,x)-ton-1;
    if(!pos)
	{
		delta[1]+=y;
		delta[x+1]-=y;
	}
    else
	{
		f[pos]+=x/ton[pos]*y;
		work(x%ton[pos],y);
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	ton[++top]=n;
	for(int i=1;i<=m;i++)
	{
		ll a;
		scanf("%lld",&a);
		while(a<=ton[top]) top--;
		ton[++top]=a;
	}
	f[top]=1;
	for(int i=top;i>=2;i--)
	{
		f[i-1]+=ton[i]/ton[i-1]*f[i];
		work(ton[i]%ton[i-1],f[i]);
	}
	delta[1]+=f[1];
	delta[ton[1]+1]-=f[1];
	ll ans=0;
	for(int i=1;i<=n;i++)
	{
		ans+=delta[i];
		printf("%lld\n",ans);
	}
	return 0;
}
