#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
const ll MOD=1e9+7;

const int N=(1<<18);

struct Seg{
  int mn,d;
  Seg(int v=MOD){
    mn=v; d=0;
  }
  static Seg e;
};
Seg Seg::e=Seg();
ostream& operator<<(ostream &os, const Seg &t) { return os<<"("<<t.mn<<","<<t.d<<")";}
Seg seg[2*N+10];
Seg operator+(const Seg l,const Seg r){
  return l.mn<r.mn?l:r;
}
inline void lazy_eval(int k,int a,int b){
  if(!seg[k].d)return;
  seg[k].mn+=seg[k].d;
  if(2*k<=2*N+5){
    seg[2*k+1].d+=seg[k].d;
    seg[2*k+2].d+=seg[k].d;
  }
  seg[k].d=0;
}

inline void upd_node(int k){seg[k]=seg[2*k+1]+seg[2*k+2];}

void upd(int l,int r,int ope,Seg seg[]=seg,int k=0,int a=0,int b=N){
  //cout<<"update:"<<l<<","<<r<<","<<x<<","<<d<<","<<a<<","<<b<<endl;
  lazy_eval(k,a,b);
  if(b<=l || r<=a) return; 
  if(l<=a && b<=r){
    seg[k].d+=ope;
    lazy_eval(k,a,b);
    return;
  }	
  int m=(a+b)/2;
  upd(l,r,ope,seg,2*k+1,a,m);
  upd(l,r,ope,seg,2*k+2,m,b);
  upd_node(k);
}

Seg query(int l,int r,Seg seg[]=::seg,int k=0,int a=0,int b=N){
  lazy_eval(k,a,b);
  if(b<=l || r<=a)return Seg::e; 
  if(l<=a && b<=r){return seg[k];}
  
  int m=(a+b)/2;
  Seg vl=query(l,r,seg,2*k+1,a,m);
  Seg vr=query(l,r,seg,2*k+2,m,b);
  upd_node(k);
  //cout<<a<<","<<b<<":"<<vl<<","<<vr<<endl;
  return vl+vr;
}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int n,m;
  cin>>n>>m;
  vector<pii> ps(n);
  rep(i,n) cin>>ps[i].X>>ps[i].Y;
  sort(rall(ps),[](pii x,pii y){return x.Y<y.Y;});
  rep(i,m+1) seg[N-1+i]=Seg(i);
  rrep(i,N-1) seg[i]=seg[i*2+1]+seg[i*2+2];
  //rep(i,m+1) cout<<query(i,i+1);cout<<endl;
  vector<int> rs(m+2,0);
  for(pii p:ps){
    upd(p.X,m+1,-1);
    //out(p,query(0,m+1),1);
    if(query(0,m+1).mn<0){// out("ng",1);
      upd(p.X,m+1,1);
      rs[p.Y]++;
    }
  }
  int inf=0;
  reps(i,1,m+1){
    inf+=rs[i];
    if(inf){
      upd(i,m+1,-1);
      if(query(0,m+1).mn<0){
	upd(i,m+1,1);
      }else{
	//out(i,1);
	--inf;
      }
    }
  }
  cout<<inf+rs[m+1]<<endl;
  // multiset<pii> st(all(ps));
  // int inf=0;
  // vector<int> rs(m+1);
  // int re=max(n-m,0);
  // reps(x,1,m+1){
  //   while(ps.size() && -ps.back().Y<x){
  //     auto it=st.find(ps.back());
  //     if(it!=st.end()){
  // 	st.erase(it);
  // 	++rs[ps.back().X];
  // 	out("x",ps.back(),1);
  //     }
  //     ps.pop_back();
  //   }
  //   inf+=rs[x];
  //   if(st.size()){
  //     auto it=st.end(); --it;
  //     out(x,*it,1);
  //     st.erase(it);
  //   }else if(inf){
  //     out(x,inf,1);
  //     --inf;
  //   }else{
  //     ++re;
  //   }
  // }
  // cout<<re<<endl;
  return 0;
}


Measured memory_bytes: 6656