Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Cottage Village

time limit per test

2 secondsmemory limit per test

64 megabytesinput

standard inputoutput

standard outputA new cottage village called «Flatville» is being built in Flatland. By now they have already built in «Flatville» *n* square houses with the centres on the *Оx*-axis. The houses' sides are parallel to the coordinate axes. It's known that no two houses overlap, but they can touch each other.

The architect bureau, where Peter works, was commissioned to build a new house in «Flatville». The customer wants his future house to be on the *Оx*-axis, to be square in shape, have a side *t*, and touch at least one of the already built houses. For sure, its sides should be parallel to the coordinate axes, its centre should be on the *Ox*-axis and it shouldn't overlap any of the houses in the village.

Peter was given a list of all the houses in «Flatville». Would you help him find the amount of possible positions of the new house?

Input

The first line of the input data contains numbers *n* and *t* (1 ≤ *n*, *t* ≤ 1000). Then there follow *n* lines, each of them contains two space-separated integer numbers: *x*_{i} *a*_{i}, where *x*_{i} — *x*-coordinate of the centre of the *i*-th house, and *a*_{i} — length of its side ( - 1000 ≤ *x*_{i} ≤ 1000, 1 ≤ *a*_{i} ≤ 1000).

Output

Output the amount of possible positions of the new house.

Examples

Input

2 2

0 4

6 2

Output

4

Input

2 2

0 4

5 2

Output

3

Input

2 3

0 4

5 2

Output

2

Note

It is possible for the *x*-coordinate of the new house to have non-integer value.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/24/2020 21:17:51 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|