B"We've got no test cases. A big olympiad is coming up. But the problemsetters' number one priority should be adding another problem to the round. The diameter of a multiset of points on the line is the largest distance between two points from this set. For example, the diameter of the multiset {1, xe2 x80 x893, xe2 x80 x892, xe2 x80 x891} is 2. Diameter of multiset consisting of one point is 0. You are given n points on the line. What is the minimum number of points you have to remove, so that the diameter of the multiset of the remaining points will not exceed d? The first line contains two integers n and d (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100, xe2 x80 x890 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89d xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100) -- the amount of points and the maximum allowed diameter respectively. The second line contains n space separated integers (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89xi xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100) -- the coordinates of the points. Output a single integer -- the minimum number of points you have to remove. In the first test case the optimal strategy is to remove the point with coordinate 4. The remaining points will have coordinates 1 and 2, so the diameter will be equal to 2 xe2 x80 x89- xe2 x80 x891 xe2 x80 x89= xe2 x80 x891. In the second test case the diameter is equal to 0, so its is unnecessary to remove any points. In the third test case the optimal strategy is to remove points with coordinates 1, 9 and 10. The remaining points will have coordinates 3, 4 and 6, so the diameter will be equal to 6 xe2 x80 x89- xe2 x80 x893 xe2 x80 x89= xe2 x80 x893. "...