#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
const int N=1e5+5;
int n,m;
ll ans[N];
map<int,ll> cnt;
map<int,ll>::iterator split(int p){
	if(!cnt.count(p)){
		ll v=prev(cnt.upper_bound(p))->second;
		cnt[p]=v;
	}
	return prev(cnt.lower_bound(p));
}
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cnt[1]=cnt[n+1]=0;
	cin>>n>>m;
	For(test,1,m){
		ll a,b;
		cin>>a>>b;
		auto it=split(a+1);
		for(;it!=cnt.begin();it=prev(cnt.erase(it))){
			ll need=(a-it->first+1)*(prev(it)->second-it->second);
			if(b>=need) b-=need;
			else break;
		}
		ll len=a-it->first+1,pre=it->second;
		it->second+=b/len+1;
		cnt[it->first+b%len]=pre+b/len;
	}
	for(auto it=cnt.begin();next(it)!=cnt.end();++it){
		For(i,it->first,next(it)->first-1){
			ans[i]=it->second;
		}
	}
	For(i,1,n) cout<<ans[i]<<'\n';
	return 0;
}