import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

n,m = map(int,input().split())
ans = [0]*(n+10)
for i in range(m):
  l,r = map(int,input().split())
  ans[n-l] += 1
  ans[n-r+1] -= 1

for i in range(1,n+10):
  ans[i] += ans[i-1]
ans = ans[:n]
print(*ans, sep = "\n")