#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& a) {
  return os << "(" << a.first << "," << a.second << ")";
}
template <class T>
void pv(T a, T b) {
  for (T i = a; i != b; ++i) cout << (*i) << " ";
  cout << endl;
}
template <class T>
bool chmin(T& a, const T& b) {
  return a > b ? (a = b, 1) : 0;
}
template <class T>
bool chmax(T& a, const T& b) {
  return a < b ? (a = b, 1) : 0;
}
int nextInt() {
  int x;
  scanf("%d", &x);
  return x;
}
int main2() {
  int N = nextInt();
  int M = nextInt();
  vector<pair<int, int>> ranges;
  for (int i = 0, _n = (int)(N); i < _n; ++i) {
    int L = nextInt();
    int R = nextInt();
    if (L + 1 == R) {
      L = M;
      R = M + 1;
    }
    ranges.push_back(make_pair(R, L + M));
  }
  sort((ranges).begin(), (ranges).end(),
       [](const pair<int, int>& a, const pair<int, int>& b) -> bool {
         if (a.second != b.second) return a.second < b.second;
         return a.first < b.first;
       });
  int shit = 0;
  int last_pos = -1;
  for (pair<int, int> range : ranges) {
    if (last_pos <= range.second) {
      last_pos = min(last_pos, range.first);
      last_pos++;
      shit++;
    }
  }
  cout << (N - shit) << endl;
  return 0;
}
int main() {
  for (; !cin.eof(); cin >> ws) main2();
  return 0;
}
