class BIT:
    def __init__(self, n):
        self.n = n
        self.bit = [0]*(self.n+1) # 1-indexed

    def init(self, init_val):
        for i, v in enumerate(init_val):
            self.add(i, v)

    def add(self, i, x):
        # i: 0-indexed
        i += 1 # to 1-indexed
        while i <= self.n:
            self.bit[i] += x
            i += (i & -i)

    def sum(self, i, j):
        # return sum of [i, j)
        # i, j: 0-indexed
        return self._sum(j) - self._sum(i)

    def _sum(self, i):
        # return sum of [0, i)
        # i: 0-indexed
        res = 0
        while i > 0:
            res += self.bit[i]
            i -= i & (-i)
        return res

    def lower_bound(self, x):
        s = 0
        pos = 0
        depth = self.n.bit_length()
        v = 1 << depth
        for i in range(depth, -1, -1):
            k = pos + v
            if k <= self.n and s + self.bit[k] < x:
                    s += self.bit[k]
                    pos += v
            v >>= 1
        return pos

    def __str__(self): # for debug
        arr = [self.sum(i,i+1) for i in range(self.n)]
        return str(arr)

import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

from itertools import accumulate

n, m = map(int, input().split())
Q = [[] for i in range(m)]
CR = [0]*(m+1)
bit = BIT(m+1)
L = []
for i in range(n):
    l, r = map(int, input().split())
    if l > r:
        l, r = r, l
    Q[r].append(l)
    bit.add(l, 1)
    L.append(l)
    CR[r+1] += 1

ans = n*(n-1)//2
CR = list(accumulate(CR))
for l in L:
    ans -= CR[l]
Q = [sorted(x) for x in Q]
for r in range(m):
    for l in Q[r]:
        ans -= bit.sum(0, l)
        bit.add(l, -1)
print(ans)