import java.util.ArrayList;
import java.util.Scanner;

/**
 * Created by saveliyyusufov on 10/22/16.
 */
public class B {

    static int subsequenceCount = 0;

    static int[] dataSet = new int[30];

    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);

        int p = in.nextInt();

        int k;

        /* // Prints an array
        for (int i = 0; i < dataSet.length; i++) {
            System.out.print(dataSet[i] + " ");
        } */

        while (p > 0) {
            k = in.nextInt();

            // Fill data set with input integers
            for(int i = 0; i < 12; i++) {
                dataSet[i] = in.nextInt();
            }

            // Set min to the current element at index i
            for(int i = 0; i < 12; i++) {
                int min = dataSet[i];

                // Set min to the minimum value between min and every subarray
                // starting from index j
                for(int j = i; j < 12;j++) {
                    min = Math.min(min, dataSet[j]);

                    // If min is smaller than
                    if(min > dataSet[j + 1] && min > dataSet[i - 1]) {
                        subsequenceCount++;
                    }

                }
            }
            System.out.println(k + " " + subsequenceCount);
            subsequenceCount = 0;
            p--;
        }


    } // end main
} // end class