#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <cassert>
#include <ctime>
#include <cmath>
#include <string>
#include <cstring>
#include <queue>
using namespace std;

#define f first
#define s second
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(v) (v).begin(), (v).end()
#define forit(it,v) for (__typeof(v.begin()) it = v.begin(); it != v.end(); ++it)
#define f0(a) memset(a, 0, sizeof(a))
#define ll long long
const int maxn = (int)1e6;
int n, t, An;
int p[maxn], v[maxn];
int main() {
    freopen("cowjog.in", "r", stdin);
    freopen("cowjog.out", "w", stdout);
    scanf("%d%d", &n, &t);

    for (int i = 0; i < n; ++i)
        scanf("%d%d", &p[i], &v[i]);
    ll mini = (ll)9e18;
    int ans = 0;
    for (int i = n - 1; i >= 0; --i) {
        ll x = p[i] + 1ll * v[i] * t;
        if (mini > x) ++ans;
        mini = min(mini, x);
    }
    cout << ans << endl;
    return 0;
}