404527: GYM101532 G Magical Indices

Alaa sometimes feels bored at work, so at such times she starts playing with a beautiful array a consisting of n integers a₁, a₂, ..., a_n.

Alaa starts counting the number of magical indices in the array a. An index x is said to be magical if it satisfying the following rules:

1. 1 < x < n
2. a_y ≤ a_x, for each y (1 ≤ y < x).
3. a_x ≤ a_z, for each z (x < z ≤ n).

Can you help Alaa by counting the number of magical indices in the array a.

The first line contains an integer T, where T is the number of test cases.

The first line of each test case contains an integer n (1 ≤ n ≤ 10⁶), where n is the size of the array a.

The second line of each test case contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁶), giving the array a.

For each test case, print a single line containing the number of magical indices in the array a.

2
8
2 1 3 4 6 5 7 9
6
4 2 7 9 8 10

3
1

As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.