#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 10;

int n, Q;
vector<long long> vec;
long long a[MAXN], b[MAXN];
long long answer[MAXN];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> Q;
	vec.push_back(n);
	for (int i = 1; i <= Q; i++)
	{
		long long q;
		cin >> q;
		while (vec.size() && vec.back() >= q)
			vec.pop_back();
		vec.push_back(q);
	}
	int z = vec.size();
	a[z - 1] = 1;
	for (int i = z - 1; ~i; i--)
	{
		long long local = vec[i];
		while (true)
		{
			int id = lower_bound(vec.begin(), vec.begin() + i, local) - vec.begin();
			if (id == 0)
			{
				b[local] += a[i];
				break;
			}
			a[id - 1] += a[i] * (local / vec[id - 1]);
			local %= vec[id - 1];
		}
	}
	for (int i = n; i; i--)
	{
		b[i] += b[i + 1];
	}
	for (int i = 1; i <= n; i++)
		cout << b[i] << '\n';
	return 0;
}