#include <bits/stdc++.h>
using namespace std;

struct BIT{
    vector<int> bit;
    BIT(int n) : bit(n, 0){}
    int range_sum(int i, int j) {return sum(j) - sum(i - 1);}
    // return sum of v[i] to v[j] including both ends.
    int sum(int j){
        int s = 0;
        for (; j >= 0; j = (j & (j + 1)) - 1) s += bit[j];
        return s;
    }
    void add(int k, int a) {for (; k < bit.size(); k |= k + 1) bit[k] += a;}
};

class SegTree01Packed{
    int n;
    int m;
    vector<unsigned long long> data;
    BIT bit;
public:
    SegTree01Packed(int _n): n(_n), m((n - 1)/64 + 1), data(m, 0), bit(m){}
    void modify(int i, int v){
        assert(v == 0 or v == 1);
        assert(i >= 0 and i < n);
        int j = i / 64;
        int k = i % 64;
        if ((data[j] >> k) & 1ull == v) return;
        data[j] ^= (1ull << k);
        bit.add(j, 2 * v - 1);
    }
    int query(int i){
        // return sum of [0, i)
        assert(i >= 0 and i < n);
        int j = i / 64;
        int k = i % 64;
        return bit.sum(j) + __builtin_popcount(data[j] & ((1ull << k) - 1ull));
    }
    int query(int l, int r){
        // return sum of [l, r) of data.
        assert(l <= r);
        return query(r) - query(l);
    }
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    vector<int> Es(M, -1);
    for (int i = 0; i < N; ++i){
        int a, b;
        cin >> a >> b;
        if (a > b){
            Es[b] = a;
        }else{
            Es[a] = b;
        }
    }
    SegTree01Packed seg(M);
    long long cnt = 0;
    for (int a = 0; a < M; ++a){
        if (Es[a] == -1) continue;
        cnt += 1LL * seg.query(a, Es[a]);
        seg.modify(Es[a], 1);
    }
    cout << cnt << endl;
    return 0;
}