Ordering of strings
Submissions: 1704   Accuracy:

62.61%

  Difficulty: Easy   Marks: 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

** For More Input/Output Examples Use 'Expected Output' option **

Author: Hemang Sarkar


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.