#include<iostream>#include<stack>#include<queue>#include<map>#include<cstring>#include<sstream>#include<algorithm>#include<vector>#include<queue>usingnamespace std;#defineintlonglongconstint N =1e7+10;typedef pair<int,int> PII;typedef pair<int, PII> PIII;int n, m;int ad[N],re[N];int lx[N], rx[N];signedmain(){
cin.tie(0); cout.tie(0); ios::sync_with_stdio(0);int n, m; cin >> n >> m;int mas =0;for(int i =1; i <=n; i++){int l, r; cin >> l >> r;
ad[l]++; re[r]++;
lx[l]+= i; rx[r]+=i;}int tot =0, cnt =0;for(int i =1; i <= m; i++) tot += ad[i], cnt += lx[i];int mx = tot, mz = cnt, ans =1;for(int i = m +1; i < N; i++){
tot += ad[i]; cnt += lx[i];
tot -= re[i-m]; cnt -= rx[i-m];if(tot > mx ||(tot==mx && cnt > mz)){
tot = mx, mz = cnt; ans =1;}elseif(tot == mx && cnt == mz)ans++;}
cout << ans << endl;}