#include <algorithm>
#include <iostream>
using namespace std;
int main() {
    int n, m; cin >> n >> m;
    pair<int, int> a[100000];
    int bit[200002] = {};
    for (int i = 0; i < n; i++) {
        int x, y; cin >> x >> y;
        if (x > y) swap(x, y);
        a[i] = make_pair(x, y);
    }
    sort(a, a+n);
    long long ans = 0;
    for (int i = 0; i < n; i++) {
        for (int x = a[i].second; x > 0; x -= x&-x) ans += bit[x];
        for (int x = a[i].first; x > 0; x -= x&-x) ans -= bit[x];
        for (int x = a[i].second; x <= m; x += x&-x) bit[x]++;
    }
    cout << ans << endl;
}