Pseudocode of any language and an explanation of how the algorithm works is fine.

You are given two sorted lists of integers of length m and n. Give an O(log m + log n) time algorithm for computing the kth smallest integer in the union of the lists