Problem:
Score : 1000 points

Problem Statement

There are M chairs arranged in a line. The coordinate of the i-th chair (1 ≤ i ≤ M) is i.

N people of the Takahashi clan played too much games, and they are all suffering from backaches. They need to sit in chairs and rest, but they are particular about which chairs they sit in. Specifically, the i-th person wishes to sit in a chair whose coordinate is not greater than L_i, or not less than R_i. Naturally, only one person can sit in the same chair.

It may not be possible for all of them to sit in their favorite chairs, if nothing is done.
Aoki, who cares for the health of the people of the Takahashi clan, decides to provide additional chairs so that all of them can sit in chairs at their favorite positions.

Additional chairs can be placed at arbitrary real coordinates. Find the minimum required number of additional chairs.

Constraints

1 ≤ N,M ≤ 2 × 10^5

0 ≤ L_i < R_i ≤ M + 1(1 ≤ i ≤ N)

All input values are integers.

Input

Input is given from Standard Input in the following format:

N M
L_1 R_1
:
L_N R_N

Output

Print the minimum required number of additional chairs.

Sample Input 1

4 4
0 3
2 3
1 3
3 4

Sample Output 1

0

The four people can sit in chairs at the coordinates 3, 2, 1 and 4, respectively, and no more chair is needed.

Sample Input 2

7 6
0 7
1 5
3 6
2 7
1 6
2 6
3 7

Sample Output 2

2

If we place additional chairs at the coordinates 0 and 2.5, the seven people can sit at coordinates 0, 5, 3, 2, 6, 1 and 2.5, respectively.

Sample Input 3

3 1
1 2
1 2
1 2

Sample Output 3

2

Sample Input 4

6 6
1 6
1 6
1 5
1 5
2 6
2 6

Sample Output 4

2

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

//arc076 F
//by Cydiater
//2017.6.30
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define up(i,j,n)	for(int i=j;i<=n;i++)
#define down(i,j,n)	for(int i=j;i>=n;i--)
#define cmax(a,b)	a=max(a,b)
#define cmin(a,b)	a=min(a,b)
#define SZ(x)		(int)x.size()

const int MAXN=2e5+5;
const int oo=0x3f3f3f3f;

int N,M,ans=0;
vector<int>upper[MAXN];

namespace Seg{
	struct tree{
		int mk,mx;
	}t[MAXN<<2];
	void rel(int k){t[k].mx=max(t[k<<1].mx,t[k<<1|1].mx);}
	void mark(int k,int mk){
		t[k].mk+=mk;
		t[k].mx+=mk;
	}
	void Pushdown(int k){
		if(!t[k].mk)return;
		mark(k<<1,t[k].mk);
		mark(k<<1|1,t[k].mk);
		t[k].mk=0;
	}
	void Build(int le,int ri,int k){
		if(le==ri){
			t[k].mx=-(M-le+1);
			return;
		}
		int mi=(le+ri)>>1;
		Build(le,mi,k<<1);
		Build(mi+1,ri,k<<1|1);
		rel(k);
	}
	void Modify(int le,int ri,int k,int l,int r,int v){
		if(le!=ri)Pushdown(k);
		if(l<=le&&ri<=r){
			mark(k,v);
			return;
		}
		int mi=(le+ri)>>1;
		if(l<=mi)	Modify(le,mi,k<<1,l,r,v);
		if(mi+1<=r)	Modify(mi+1,ri,k<<1|1,l,r,v);
		rel(k);
	}
	int Query(int le,int ri,int k,int l,int r){
		if(le!=ri)Pushdown(k);
		if(l<=le&&ri<=r)return t[k].mx;
		int mi=(le+ri)>>1,mx=-oo;
		if(l<=mi)	cmax(mx,Query(le,mi,k<<1,l,r));
		if(mi+1<=r)	cmax(mx,Query(mi+1,ri,k<<1|1,l,r));
		return mx;
	}
}using namespace Seg;

namespace solution{
	void Prepare(){
		scanf("%d%d",&N,&M);
		cmax(ans,N-M);
		up(i,1,N){
			int l,r;
			scanf("%d%d",&l,&r);
			upper[l].push_back(r);
		}
		Build(0,M+1,1);
	}
	void Solve(){
		up(i,0,M){
			up(j,0,SZ(upper[i])-1)Modify(0,M+1,1,0,upper[i][j],1);
			cmax(ans,Query(0,M+1,1,i+1,M+1)-i);
		}
		cout<<ans<<endl;
	}
}

int main(){
//	freopen("input.in","r",stdin);
	using namespace solution;
	Prepare();
	Solve();
	return 0;
}