You are given two integer arrays A[] and B[] sorted in ascending order and an integer k. Define a pair (a, b) which consists of one element from the first array and one element from the second array. Write a program to find the k pairs (a1, b1),(a2, b2) ...(ak, bk) with the smallest sums.

Example 1

Input: A[] = [1,7,11], B[] = [2,4,6], k = 3
Output: [[1,2],[1,4],[1,6]] 
Explanation: The first 3 pairs are returned from the sequence: [1,2],[1,4],[1,6],[7,2],[7,4],[11,2],[7,6],[11,4],[11,6]

Example 2

Input: A[] = [1,1,2], B[] = [1,2,3], k = 2
Output: [1,1],[1,1]
Explanation: The first 2 pairs are returned from the sequence: [1,1],[1,1],[1,2],[2,1],[1,2],[2,2],[1,3],[1,3],[2,3]

Example 3

Input: A[] = [1,2], B[] = [3], k = 3
Output: [1,3],[2,3]
Explanation: All possible pairs are returned from the sequence: [1,3],[2,3]