#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 200000 + 5;

int N, M, ans;
pair<int,int> a[MAX_N];

int main() {
    scanf("%d%d", &N, &M);
    for (int i = 1; i <= N; i ++) {
        scanf("%d%d", &a[i].first, &a[i].second);
    }
    sort(a + 1, a + 1 + N);
    multiset<int> s, q, w;
    for (int i = 1; i <= M; i ++) {
        s.insert(i);
    }
    for (int i = 1; i <= N; i ++) {
        int l = a[i].first, r = a[i].second;
        auto it = s.begin();
        if (it != s.end() && *it <= l) {
            s.erase(it);
            q.insert(r);
        } else {
            q.insert(r);
            int t = *q.begin();
            w.insert(t);
            q.erase(t);
        }
    }
    for (int r: w) {
        auto it = s.lower_bound(r);
        if (it == s.end()) {
            ans ++;
        } else {
            s.erase(it);
        }
    }
    printf("%d\n", ans);
    return 0;
}