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 <algorithm>
#include <cstdio>
using ll = long long;
ll arr[100005], val[100005], ans[100005];
int main()
{
	// freopen("AGC003-E.in", "r", stdin);
	int n, m;
	scanf("%d%d", &n, &m);
	arr[0] = n;
	for (int i = 1; i <= m; i++)
		scanf("%lld", arr + i);
	m = 0;
	for (int i = 0; arr[i]; i++)
	{
		while (m && arr[i] <= arr[m - 1])
			m--;
		arr[m++] = arr[i];
	}
	val[m - 1] = 1;
	for (int i = m - 1; i >= 0; i--)
	{
		ll x = arr[i];
		while (true)
		{
			int pos = std::upper_bound(arr, arr + i, x) - arr - 1;
			if (pos < 0)
				break;
			val[pos] += val[i] * (x / arr[pos]);
			x %= arr[pos];
		}
		if (x)
			ans[x] += val[i];
	}
	for (int i = n; i; i--)
		ans[i] += ans[i + 1];
	for (int i = 1; i <= n; i++)
		printf("%lld\n", ans[i]);
	return 0;
}
