Since the Winter has come and the Great War is arriving, the Night King decides to choose some men from his Army of Dead as Commanding Solders of the army. He selects 'N' dead men with finest skills and strength and organises a battle amongst them. The soldiers that remain undefeated are appointed as the Commnading Soldiers of the army. The 'N' dead men enter the battle in such a way that the dead man entering at $ith$ second has strength $A[i]$ and is able to defeat all the contestants who have already arrived before $ith$ second and whose strength is less than or equal to the strength of the $ith$ dead man.

Your task is to help the Night King in finding out the number of Commanding Soldiers that can be appointed by him.

INPUT

First line of input contains T - denoting number of test cases .

Second line of each test case contains one integer number N .

The third line contains n space separated integers  A₁, A₂, ..., A_n  where Ai denotes the strength of ith dead man.

OUTPUT

Output will contain the number of commanding soldiers appointed.

CONSTRAINTS

$1 \leq T \leq 10$

$1 \leq N \leq 3*10^{5}$

$1 \leq A[i] \leq 10^{9}$