n,cost = map(int,input().split())
tokyo,kyoto = map(int,input().split())
kyoto -= cost
for i in range(1,n):
    t,k = map(int,input().split())
    tokyo,kyoto = max(tokyo+t,kyoto+t-cost),max(tokyo+k-cost,kyoto+k)
print(max(tokyo,kyoto))