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

template <class T> struct fenwick_tree {
    using U = T;

    public:
    fenwick_tree() : _n(0) {}
    fenwick_tree(int n) : _n(n), data(n) {}

    void add(int p, T x) {
        assert(0 <= p && p < _n);
        p++;
        while (p <= _n) {
            data[p - 1] += U(x);
            p += p & -p;
        }
    }

    T sum(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        return sum(r) - sum(l);
    }

    private:
    int _n;
    std::vector<U> data;

    U sum(int r) {
        U s = 0;
        while (r > 0) {
            s += data[r - 1];
            r -= r & -r;
        }
        return s;
    }
};

int main(){
	ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, l, r;
    cin >> n >> m;
    vector<int> tb(m, -1);
    for(int i = 0; i < n; i++){
        cin >> l >> r;
        if(l > r) swap(l, r);
        tb[l] = r;
        tb[r] = l;
    }
    ll ans = 0;
    fenwick_tree<ll> fw(m);
    for(int i = 0; i < m; i++){
        if(tb[i] == -1) continue;
        if(tb[i] < i){
            ans += fw.sum(tb[i], i);
            fw.add(tb[i], -1);
            fw.add(i, 1);
        }
    }
    cout << ans << '\n';
}