1782. Space

输入格式

On the first line an integer t (1 <= t <= 100): the number of test cases. Then for each test

case:

1. One line with two integers n (1 <= n <= 100 000) and d (1 <= d <= 50): the number of

teams and the minimum distance between two teams.

1. n lines with two integers xi (0 <= xi <= 1 000 000 000) and yi (0 <= yi <= 1 000 000 000):

the coordinates of the i-th team. No two teams will have the same coordinates.

输出格式

For each test case:

1. One line with the number of pairs of teams that sit too close to each other.

Notes

The Euclidean distance between points (x1, y1) and (x2, y2) is sqrt((x1 − x2)^2 + (y1 − y2)^2).

1
6 3
0 0
0 3
2 1
2 3
3 0
3 1

8