// Arup Guha
// 5/9/2018
// Solution to USACO 2014 December Silver Problem: Cow Jog

import java.util.*;
import java.io.*;

public class cowjog_silver {

	public static int n;
	public static long t;
	public static long[] cur;

	public static void main(String[] args) throws Exception {

		// Read in data.
		BufferedReader stdin = new BufferedReader(new FileReader("cowjog.in"));
		StringTokenizer tok = new StringTokenizer(stdin.readLine());
		n = Integer.parseInt(tok.nextToken());
		t = Long.parseLong(tok.nextToken());
		cur = new long[n];

		// We just need to read in the number of values of each parity for each letter.
		for (int i=0; i<n; i++) {
			tok = new StringTokenizer(stdin.readLine());
			long pos = Long.parseLong(tok.nextToken());
			long vel = Long.parseLong(tok.nextToken());
			cur[i] = pos + t*vel;
		}

		// Store increasing mins here.
		Stack<Long> s = new Stack<Long>();
		s.push(cur[0]);

		// Place the ith item.
		for (int i=1; i<n; i++) {

			// Find the right spot for it.
			while (s.size() > 0 && cur[i] <= s.peek()) s.pop();

			// Now put this on the stack.
			s.push(cur[i]);
		}

		// Write result.
		PrintWriter out = new PrintWriter(new FileWriter("cowjog.out"));
		out.println(s.size());
		out.close();
		stdin.close();
	}
}