there is a black box which calculates the floor(in/m) smallest number in the array

use the black box to calculate the "k" smallest number in the array in lenear time

(n is the size of the array ,m is a constant)

need guidance on the general idea of solving it

?

if i=m/2 then we get the median

what now?