class Bit:
    """1-indexed"""

    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)

    def _sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

    def sum(self, i, j):
        """閉区間[i, j]"""
        return self._sum(j) - self._sum(i - 1)

    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i


N, M = map(int, input().split())
B = Bit(M)
queries = []
for i in range(N):
    a, b = sorted([int(x) + 1 for x in input().split()])
    queries.append((a, 1))
    queries.append((b, 2, a))
queries.sort()

ans = 0
for q in queries:
    if q[1] == 1:
        B.add(q[0], 1)
    elif q[1] == 2:
        B.add(q[2], -1)
        ans += B.sum(q[2], q[0])
print(ans)