import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

class SegmentTree(object):
	#N:処理する区間の長さ
	def __init__(self, N):
		self.N0 = 2 ** (N - 1).bit_length()
		self.data = [0] * (2 * self.N0)

	#k番目の値をxに更新
	def update(self, k, x):
		k += self.N0 - 1
		self.data[k] = x
		while k > 0:
			k = (k - 1) // 2
			self.data[k] = self.data[2 * k + 1] + self.data[2 * k + 2]

	#区間[l, r]の和
	def query(self, l, r):
		L = l + self.N0; R = r + self.N0 + 1
		m = 0
		while L < R:
			if R & 1:
				R -= 1
				m = m + self.data[R - 1]
			if L & 1:
				m = m + self.data[L - 1]
				L += 1
			L >>= 1; R >>= 1

		return m

#処理内容
def main():
	N, M = getlist()
	SegL = SegmentTree(M)
	SegR = SegmentTree(M)
	L = []
	for i in range(N):
		l, r = list(sorted(getlist()))
		L.append([l, r])
		SegL.update(l, 1)
		SegR.update(r, 1)

	L.sort()

	ans = 0
	for l, r in L:
		val = abs(SegL.query(l, r) - SegR.query(l, r))
		ans += val
		SegL.update(l, 0)
		SegR.update(r, 0)
		SegL.update(r, 1)
		SegR.update(l, 1)

	# print(ans)
	print(int(ans // 2))

if __name__ == '__main__':
	main()