**Compilation/Execution Result:**

Given an array, find inversion count of array.

* Inversion Count *for an array indicates – how far (or close) the array is from being sorted. If array is already sorted then inversion count is 0. If array is sorted in reverse order that inversion count is the maximum.

Formally speaking, two elements a[i] and a[j] form an inversion if a[i] > a[j] and i < j.

The sequence 2, 4, 1, 3, 5 has three inversions (2, 1), (4, 1), (4, 3).

**Input:**

The first line of input contains an integer T denoting the number of test cases.

The first line of each test case is N,N is the size of array.

The second line of each test case contains N input C[i].

**Output:**

Print the inversion count of array.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 100

1 ≤ C ≤ 500

**Example:**

**Input:**

1

5

2 4 1 3 5

**Output:**

3

surbhi_7 | 128 |

Rajat Thakur 2 | 115 |

John Carey | 92 |

shaktiman_shaktiman_shaktiman | 91 |

nancygarg258_pec | 90 |

Ibrahim Nash | 604 |

ashrepos | 490 |

RealHorror | 368 |

shaktiman_shaktiman_shaktiman | 363 |

shi143din | 343 |

akhayrutdinov | 4052 |

sanjay05 | 3406 |

Quandray | 2435 |

Michael Riegger | 2228 |

Jasleen Kaur 2 | 2012 |