Selection sort is one of the simplest and inefficient sorting algorithms. Although it is very simple and easy to implement, its inefficiency makes it almost unusable when dealing with large data sets.

First line of input contains T - number of test cases. Its followed by 2T lines. First line of each test case contains N - size of the array. The next line contains N integers - elements of the array.