#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int N = 2e5 + 5;

struct peo{
    int l, r;
    bool operator<(const peo &b)const{
        return l != b.l ? l < b.l : r > b.r;
    }
}a[N];
int temp[N];

priority_queue<int, vector<int>, greater<int> >q;

void solve(){
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> a[i].l >> a[i].r;
    sort(a + 1, a + 1 + n);
    int h = 1, t = m;
    int ind = 0;
    for(int i = 1; i <= n; i++){
        q.push(a[i].r);
        if(h <= t && h <= a[i].l) h++;
        else temp[++ind] = q.top();
        q.pop();
    }
    int ans = 0;
    sort(temp + 1, temp + 1 + ind);
    for(int i = ind; i >= 1; i--){
        if(h <= t && temp[i] <= t) t--;
        else ans++;
    }
    cout << ans << '\n';
}

int main(){
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}