import sys
#sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
from collections import defaultdict
def ceil(A,B):
    return -(-A//B)
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(sys.stdin.readline().rstrip())
    def IC(): return [int(c) for c in sys.stdin.readline().rstrip()]
    def MI(): return map(int, sys.stdin.readline().split())
    N,X = MI()
    AB = [0]*N
    for i in range(N):
        A,B = MI()
        AB[i] = (A,B)
    for j in range(1,X+1):
        ans = 0
        for a,b in AB:
            ans = max(b-abs(j-a),ans)
        print(ans,end=" ")
    print()
    return
solve()