#include <bits/stdc++.h>
using namespace std;
const int N = (int)3e5;
long long int mpow(long long int a, long long int b) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0) {
    long long int memo = mpow(a, b / 2);
    return memo * memo % (long long int)(1e9 + 7);
  } else
    return mpow(a, b - 1) * a % (long long int)(1e9 + 7);
}
long long int lpow(long long int a, long long int b) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0) {
    long long int memo = lpow(a, b / 2);
    return memo * memo;
  } else
    return lpow(a, b - 1) * a;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
vector<long long int> kaijo_memo;
long long int kaijo(long long int n) {
  if (kaijo_memo.size() > n) return kaijo_memo[n];
  if (kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while (kaijo_memo.size() <= n)
    kaijo_memo.push_back(kaijo_memo[kaijo_memo.size() - 1] * kaijo_memo.size() %
                         (long long int)(1e9 + 7));
  return kaijo_memo[n];
}
vector<long long int> gyaku_kaijo_memo;
long long int gyaku_kaijo(long long int n) {
  if (gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if (gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while (gyaku_kaijo_memo.size() <= n)
    gyaku_kaijo_memo.push_back(
        gyaku_kaijo_memo[gyaku_kaijo_memo.size() - 1] *
        mpow(gyaku_kaijo_memo.size(), (long long int)(1e9 + 7) - 2) %
        (long long int)(1e9 + 7));
  return gyaku_kaijo_memo[n];
}
long long int nCr(long long int n, long long int r) {
  if (n == r) return 1;
  if (n < r || r < 0) return 0;
  long long int ret = 1;
  ret *= kaijo(n);
  ret %= (long long int)(1e9 + 7);
  ret *= gyaku_kaijo(r);
  ret %= (long long int)(1e9 + 7);
  ret *= gyaku_kaijo(n - r);
  ret %= (long long int)(1e9 + 7);
  return ret;
}
int main(void) {
  long long int n, m;
  cin >> n >> m;
  vector<pair<long long int, long long int>> X;
  for (int i = 0; i < (int)(n); i++) {
    long long int l, r;
    cin >> l >> r;
    X.push_back({l, -r});
  }
  sort(X.begin(), X.end());
  for (int i = 0; i < (int)(n); i++) {
    X[i].second *= -1;
  }
  queue<long long int> q;
  vector<long long int> taka;
  int xi = 0;
  while (xi < X.size() && X[xi].first == 0) {
    taka.push_back(X[xi].second);
    xi++;
  }
  for (int t = 1; t <= (int)(m); t++) {
    q.push(t);
    while (xi < X.size() && X[xi].first == t) {
      if (q.size() > 0) {
        q.pop();
      } else {
        taka.push_back(X[xi].second);
      }
      xi++;
    }
  }
  cerr << q.size() << endl;
  long long int ans = 0;
  vector<long long int> mass;
  while (q.size() > 0) {
    mass.push_back(q.front());
    q.pop();
  }
  sort(mass.begin(), mass.end());
  reverse(mass.begin(), mass.end());
  for (int i = 0; i < (int)(mass.size()); i++) {
  }
  cerr << taka.size() << endl;
  reverse(taka.begin(), taka.end());
  int mi = 0;
  for (int i = taka.size() - 1; i >= 0; i--) {
    if (mi < mass.size() && taka[i] <= mass[mi]) {
      mi++;
    } else {
      ans++;
    }
  }
  cout << ans << endl;
  return 0;
}
