import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
input = sys.stdin.readline
n,m = map(int,input().split())
check = [0 for i in range(n)]
for i in range(m):
    p,q = map(int,input().split())
    p -= 1
    check[p] += q
r = [0 for i in range(n)]
temp = 0
for i in range(n):
    temp += check[i]
    r[i] = temp
    temp = max(temp-1,0)

l = [0 for i in range(n)]
temp = 0
for i in reversed(range(n)):
    temp += check[i]
    l[i] = temp
    temp = max(temp-1,0)
for i in range(n):
    print(l[i]+r[i]-check[i],end=' ')