What's the solution to the generalized problem: Given m sorted arrays each of size n, what is the fastest algorithm to find the kth smallest element in the union of the m arrays?