#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 #define N 50010

 using namespace std;

 struct data

 {

     int x,h;

 }a[N],q[N];

 int n,m,l,r;

 int ok1[N],ok2[N];

 inline int read()

 {

     int f=,ans=;

     char c;

     while (!isdigit(c=getchar())) if (c=='-') f=-;

     ans=c-'';

     while (isdigit(c=getchar())) ans=ans*+c-'';

     return ans*f;

 }

 bool cmp(data a,data b) {return a.x<b.x;}

 int main()

 {

     n=read(); m=read();

     for (int i=;i<=n;i++) a[i].x=read(),a[i].h=read();

     sort(a+,a+n+,cmp);

     l=; r=;

     for (int i=;i<=n;i++)

     {

         while (l<=r && q[r].h<a[i].h) r--;

         q[++r]=a[i];

         while (l<=r && q[l].x<a[i].x-m) l++;

         if (q[l].h>=*a[i].h) ok1[i]=;

     }

     l=; r=;

     for (int i=n;i>=;i--)

     {

         while (l<=r && q[r].h<a[i].h) r--;

         q[++r]=a[i];

         while (l<=r && q[l].x>a[i].x+m) l++;

         if (q[l].h>=*a[i].h) ok2[i]=;

     }

     int ans=;

     for (int i=;i<=n;i++)

         if (ok1[i]&&ok2[i]) ans++;

     printf("%d\n",ans);

     return ;

 }