#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MOD2 = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 5e5 + 5;
int n, m;
int l[maxn];
int r[maxn];
int compare(int i, int j) {
  if (l[i] != l[j]) return l[i] < l[j];
  return r[i] < r[j];
}
void solve() {
  cin >> n >> m;
  int mn = INF;
  for (int i = (0); i < (n); i++) {
    cin >> l[i] >> r[i];
    l[i] += m;
    swap(l[i], r[i]);
    chkmin(mn, l[i]);
  }
  vector<pair<int, int> > events;
  for (int i = (0); i < (n); i++) {
    events.push_back(make_pair(l[i], i));
    events.push_back(make_pair(r[i] + 1, -i - 1));
  }
  sort((events).begin(), (events).end());
  int tot = 0, ptr = 0;
  set<pair<int, int> > heap;
  static int used[maxn] = {};
  memset(used, 0, sizeof(used));
  for (int i = (mn); i < (mn + m + m); i++) {
    while (ptr < int((events).size()) && events[ptr].first <= i) {
      int ix = events[ptr].second;
      if (ix >= 0) {
        heap.insert(make_pair(r[ix], ix));
      } else {
        ix = -ix - 1;
        if ((heap.find(make_pair(r[ix], ix)) != heap.end())) {
          heap.erase(make_pair(r[ix], ix));
        }
      }
      ptr++;
    }
    if (!used[i % m] && int((heap).size())) {
      tot++;
      heap.erase(heap.begin());
      used[i % m] = 1;
    }
  }
  cout << n - tot << "\n";
}
int main() {
  int JUDGE_ONLINE = 1;
  if (fopen("in.txt", "r")) {
    JUDGE_ONLINE = 0;
    assert(freopen("in.txt", "r", stdin));
  } else {
    ios_base::sync_with_stdio(0), cin.tie(0);
  }
  solve();
  if (!JUDGE_ONLINE) {
  }
  return 0;
}
