B"You have n distinct points (x_1, y_1), ldots,(x_n,y_n) on the plane and a non-negative integer parameter k . Each point is a microscopic steel ball and k is the attract power of a ball when it's charged. The attract power is the same for all balls. In one operation, you can select a ball i to charge it. Once charged, all balls with Manhattan distance at most k from ball i move to the position of ball i . Many balls may have the same coordinate after an operation. More formally, for all balls j such that |x_i - x_j| + |y_i - y_j| <= k , we assign x_j:=x_i and y_j:=y_i . Your task is to find the minimum number of operations to move all balls to the same position, or report that this is impossible. The first line contains a single integer t ( 1 <= t <= 100 ) -- the number of test cases. The first line of each test case contains two integers n , k ( 2 <= n <= 100 , 0 <= k <= 10^6 ) -- the number of balls and the attract power of all balls, respectively. The following n lines describe the balls' coordinates. The i -th of these lines contains two integers x_i , y_i ( 0 <= x_i, y_i <= 10^5 ) -- the coordinates of the i -th ball. It is guaranteed that all points are distinct. For each test case print a single integer -- the minimum number of operations to move all balls to the same position, or -1 if it is impossible. In the first test case, there are three balls at (0, 0) , (3, 3) , and (1, 1) and the attract power is 2 . It is possible to move two balls together with one operation, but not all three balls together with any number of operations. In the second test case, there are three balls at (6, 7) , (8, 8) , and (6, 9) and the attract power is 3 . If we charge any ball, the other two will move to the same position, so we only require one operation. In the third test ca"...