// Arup Guha
// 3/18/2016
// Solution to 2014 NY Regional Problem A: Height Ordering

import java.util.*;

public class a {

	final public static int SIZE = 20;

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		int numCases = stdin.nextInt();

		// Process each case.
		for (int loop=1; loop<=numCases; loop++) {

			// Read in data.
			int caseNum = stdin.nextInt();
			int[] vals = new int[SIZE];
			for (int i=0; i<SIZE; i++) vals[i] = stdin.nextInt();

			// Run insertion sort, counting swaps.
			int res = 0;
			for (int i=1; i<SIZE; i++) {
				int j = i;
				while (j > 0 && vals[j-1] > vals[j]) {
					int tmp = vals[j];
					vals[j] = vals[j-1];
					vals[j-1] = tmp;
					j--;
					res++;
				}
			}

			// Output result.
			System.out.println(caseNum+" "+res);
		}
	}
}