I need help , i want solve this problem, how much points lies inside of rectangle, using a kd-tree, input: S = set of points, |S| <= 5*10^5, 10^5 queries(rectangles).