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

G. AI robots

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn the last mission, MDCS has successfully shipped $$$N$$$ AI robots to Mars. Before they start exploring, system initialization is required so they are arranged in a line. Every robot can be described with three numbers: position ($$$x_i$$$), radius of sight ($$$r_i$$$) and IQ ($$$q_i$$$).

Since they are intelligent robots, some of them will talk if they see each other. Radius of sight is inclusive, so robot can see other all robots in range $$$[x_i - r_i, x_i + r_i]$$$. But they don't walk to talk with anybody, but only with robots who have similar IQ. By similar IQ we mean that their absolute difference isn't more than $$$K$$$.

Help us and calculate how many pairs of robots are going to talk with each other, so we can timely update their software and avoid any potential quarrel.

Input

The first line contains two integers, numbers $$$N (1 \leq N \leq 10^5) $$$ and $$$K (0 \leq K \leq 20)$$$.

Next $$$N$$$ lines contain three numbers each $$$x_i, r_i, q_i (0 \leq x_i,r_i,q_i \leq 10^9)$$$ — position, radius of sight and IQ of every robot respectively.

Output

Output contains only one number — solution to the problem.

Example

Input

3 2

3 6 1

7 3 10

10 5 8

Output

1

Note

The first robot can see the second, but not vice versa. The first robot can't even see the third. The second and the third robot can see each other and their IQs don't differ more than 2 so only one conversation will happen.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/15/2019 03:13:01 (e2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|