Find K Pairs With Smallest Sums

Given two sorted arrays and k, print the k pairs (u, v), u from the first array and v from the second, with the smallest sums, one pair per line in increasing order of sum.

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