In a two-dimensional space how do i find the three closest pair points in O(n log n) time? is the same as closest pair point but the three smallest?

Question

There are no repetition of points and the logic is the logic same as in the case of closest pair points? Do I only have to return the 3 shortest distances?

I cant properly understand if the questions wants that or something else