K Pairs With Smallest Sums

Given two sorted arrays, print the k pairs (u from the first, v from the second) with the smallest sums.

1 <= n, m <= 10^5 1 <= k <= 1000