#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#define MAXN 100010
using namespace std;
long long int N,T;
struct zcow{
long long q;
long long v;
long long e;
}p[MAXN];
unsigned long long int qread()
{
unsigned long long int num=0;
char a;
a=getchar();
while(a<'0' || a>'9')
a=getchar();
while(a>='0' && a<='9')
{
num=num*10+a-'0';
a=getchar();
}
return num;
}
void work()
{
long long now=p[N].e;
int ans=1;
for(int i=N-1;i>=1;i--)
{
if(p[i].e<now)
{
ans++;
now=p[i].e;
}
}
printf("%d\n",ans);
}
void read()
{
N=qread();
T=qread();
for(int i=1;i<=N;i++)
{
p[i].q=qread();
p[i].v=qread();
p[i].e=p[i].q+p[i].v*T;
}
}
int main()
{
freopen("cowjoga.in","r",stdin);
freopen("cowjoga.out","w",stdout);
read();
work();
return 0;
}