import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
sys.setrecursionlimit(1000000)
import math
import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
from collections import defaultdict
from collections import deque
#import copy #DeepCopy: hoge = [_[:] for _ in hogehoge]
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

def main():
    N,M = map(int,input().split())
    imos = [0]*(N+1)
    for _ in range(M):
        L,R = map(int,input().split())
        L = N-L; R = N-R
        R += 1
        imos[L] += 1
        imos[R] -= 1
    for i in range(1,N):
        imos[i] += imos[i-1]
    
    print(*imos[:N],sep="\n")

if __name__ == '__main__':
    main()