Ordering of strings
Easy Accuracy: 62.55% Submissions: 4941 Points: 2

You will be given N number of strings. You have to find the lexicographically smallest string and the lexicographically largest string among these strings.

Input:
The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. The first line of each test case consists of N. In the next line are N space separated strings of lower case Latin letters only.


Output:

Corresponding to each test case, in a new line, print the lexicographically smallest string and the lexicographically largest string among the given strings separated by a single space between them.


Constraints:

1 ≤ T ≤ 100

1 ≤ N ≤ 100

1 ≤ Length of each string ≤ 40


Example:

Input

3
3
a ab abc
3
a a b
3
z xy t

Output

a abc
a b
t z

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Output Window