Magic Pairs

You have some distinct integer numbers a1,a2...an. Count number of pairs (i,j) such that:

1<= i <= n 1<= j <= n ai < aj
        
       Input:-2
2
12 11
3
13 11 12
       Input Description: The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.The first line of each test case contains a single integer n denoting the number of numbers you have. The second line contains n space-separated distinct integers a1, a2, ..., an denoting these numbers. 
       Output: 1
3
       Output Description: For each test case, output a single line containing number of pairs for corresponding test case. 
       Constraints: 1 <= T <= 4
1 <= n <= 100000
0 <= ai <= 109
All the ai are distinct
       Explanation: Case 1: Only one such pair of (i, j) indices exists: (2,1), since a2 < a1.

Case 2: 3 possible pairs of indices: (2,1), (2,3), (3,1)