Given two arrays and a number x, find the pair whose sum is closest to x and the pair has an element from each array.
The first line consists of a single integer T, the number of test cases. For each test case, the first line contains 2 integers n & m denoting the size of two arrays. Next line contains n- space separated integers denoting the elements of array A and next lines contains m space separated integers denoting the elements of array B followed by an integer x denoting the number whose closest sum is to find.
For each test case, the output is 2 space separated integers whose sum is closest to x.