#include<bits/stdc++.h>
#define ll long long
#define il inline
#define pn putchar('\n')
#define maxint 2147483647
#define min(x,y) (x<y?x:y)
#define max(x,y) (x>y?x:y)
#define maxn 100005
#define int ll
using namespace std;
int n,m;
int a[maxn],smt[maxn<<2],tag[maxn<<2];
il void pt(int pos,int l,int r)
{
    smt[pos]=tag[pos>>1]*(r-l+1);
    tag[pos]=tag[pos>>1];
}
il void pushtag(int pos,int l,int r)
{
    if(tag[pos]==-1)
        return;
    int mid=l+r>>1;
    pt(pos<<1,l,mid);
    pt(pos<<1|1,mid+1,r);
    tag[pos]=-1;
}
il int fi(int pos,int l,int r,int L,int R)
{
    if(L<=l&&r<=R)return smt[pos];
    pushtag(pos,l,r);
    int mid=l+r>>1;
    int ret=0;
    if(L<=mid)
        ret+=fi(pos<<1,l,mid,L,R);
    if(R>mid)
        ret+=fi(pos<<1|1,mid+1,r,L,R);
    return ret;
}
il void cha(int pos,int l,int r,int L,int R,int ad)
{
    if(L<=l&&r<=R)
    {
        tag[pos]=ad;
        smt[pos]=ad*(r-l+1);
        return;
    }
    pushtag(pos,l,r);
    int mid=l+r>>1;
    if(L<=mid)
        cha(pos<<1,l,mid,L,R,ad);
    if(R>mid)
        cha(pos<<1|1,mid+1,r,L,R,ad);
    smt[pos]=smt[pos<<1]+smt[pos<<1|1];
}
signed main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    scanf("%lld%lld",&n,&m);
    memset(tag,-1,sizeof tag);
    while(m--)
    {
        int x,y;
        scanf("%lld%lld",&x,&y);
        int l=1,r=x,mid,ret=x,anst,ansp;
        while(l<=r)
        {
            mid=l+r>>1;
            int t=fi(1,1,n,mid,mid),p=fi(1,1,n,mid,x);
            if(t*(x-mid+1)-p<=y)
                r=mid-1,ret=mid,anst=t,ansp=p;
            else
                l=mid+1;
        }
        int len=x-ret+1;
        y-=anst*len-ansp;
        if(y%len)
            cha(1,1,n,ret,ret+y%len-1,anst+y/len+1),cha(1,1,n,ret+y%len,x,anst+y/len);
        else
            cha(1,1,n,ret,x,anst+y/len);
    }
    for(int i=1;i<=n;i++)
        printf("%lld\n",fi(1,1,n,i,i));
    return 0;
}