#include <bits/stdc++.h>
#include <type_traits>
using namespace std;

using ll=int64_t;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(),x.end()
auto& errStream=cerr;
#ifdef LOCAL
#define cerr (cerr<<"-- line "<<__LINE__<<" -- ")
#else
class CerrDummy{}cerrDummy;
template<class T>
CerrDummy& operator<<(CerrDummy&cd,const T&){
	return cd;
}
using charTDummy=char;
using traitsDummy=char_traits<charTDummy>;
CerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){
	return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr<<"reached"<<endl
#define DMP(x) cerr<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))
#define ONE(x) memset(x,-1,sizeof(x))

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;

template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
	os<<"{";
	REP(i,(int)v.size()){
		if(i)os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

ll read(){
	ll i;
	scanf("%"  SCNd64,&i);
	return i;
}

void printSpace(){
	printf(" ");
}

void printEoln(){
	printf("\n");
}

void print(ll x,int suc=1){
	printf("%" PRId64,x);
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}

string readString(){
	static char buf[3341000];
	scanf("%s",buf);
	return string(buf);
}

char* readCharArray(){
	static char buf[3341000];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template<class T,class U>
void chmax(T& a,U b){
	if(a<b)
		a=b;
}

template<class T,class U>
void chmin(T& a,U b){
	if(b<a)
		a=b;
}

template<class T>
T Sq(const T& t){
	return t*t;
}

#define CAPITAL
void Yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void No(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

signed main(){
	int n=read();
	vi a{n};
	int q=read();
	REP(i,q){
		int b=read();
		while(!a.empty()&&a.back()>=b)
			a.pop_back();
		a.PB(b);
	}
	cerr<<a<<endl;
	reverse(ALL(a));
	
	int len=a[0],cnt=1,sum=1;
	priority_queue<pi> pq;
	FOR(i,1,a.size()){
		int nxLen=a[i],nxCnt=cnt,nxSum=0;
		
		int curSum=sum;
		while(!pq.empty()){
			pi w=pq.top();
			if(w.first>=nxLen){
				pq.pop();
				curSum-=w.second;
				{
					int x=(len+nxLen-1)/nxLen;
					int y=(w.first+nxLen-1)/nxLen;
					nxCnt+=(x-y)*w.second;
				}
				{
					int x=len/nxLen;
					int y=w.first/nxLen;
					nxSum+=(x-y)*w.second;
				}
				if(w.first%nxLen!=0)
					pq.push(pi(w.first%nxLen,w.second));
			}else
				break;
		}
		nxCnt+=((len+nxLen-1)/nxLen-1)*curSum;
		nxSum+=(len/nxLen)*curSum;
		
		if(len%nxLen!=0){
			pq.push(pi(len%nxLen,-sum));
		}
		
		len=nxLen;
		cnt=nxCnt;
		sum=nxSum;
	}
	
	vi ans(a.back(),0);
	ans[0]=cnt;
	while(!pq.empty()){
		pi w=pq.top();pq.pop();
		ans[w.first]+=w.second;
	}
	FOR(i,1,a.back())
		ans[i]+=ans[i-1];
	assert(ans[a.back()-1]==sum);
	ans.resize(n,0);
	REP(i,n)
		print(ans[i]);
}


Measured memory_bytes: 5232