n,h=map(int,input().split())
q=[0]*(h+1)
for i in range(n):
	a,b=map(int,input().split())
	q[a]+=1
	q[b+1]-=1
for i in range(1,h+1):
	q[i]+=q[i-1]
print(max(q))