1257: Ball

Give a chessboard of M ∗ M , with N point on it. You should calculate how many solutions there ar to select 3 points to make the median distance between the distance between the 3 points is a prime number? the distance between (x1, y1) and (x2, y2) is |x1 − x2| + |y1 − y2|

Each test contains multiple test cases. The first line contains the number of test cases T(1 ≤ T ≤ 10). Description of the test cases follows. 
The first line of each test case contains two integers N, M 
The next N lines each line contains two integers x_i , y_i 
It’s guaranteed there are no i, j(i != j) satisfies both x_i = x_j and y_i = y_j 
1 ≤ N ≤ 2000, 1 ≤ M ≤ 105 , 1 ≤ xi , yi ≤ M

For each test case, print one integer — the answer to the problem.

2
3 3
1 1
2 2
3 3
3 3
1 1
2 1
3 2

1
1