Maximum Showcase Count

Mario has a collection of coins arranged in a sequence. He wants to showcase some of these coins such that every coin he displays has a value strictly greater than all coins previously displayed. Formally, given a sequence of coin values \(a_1, a_2, \dots, a_N\), Mario always displays the first coin, and for each subsequent coin \(a_i\), he displays it if and only if \(a_i > \max(a_1, a_2, \dots, a_{i-1})\).

Your task is to compute the maximum number of coins Mario can showcase from his collection.

Note: The input contains multiple test cases. For each test case, first an integer \(N\) is provided, followed by a line with \(N\) space-separated integers representing the coin values.

inputFormat

The first line contains an integer \(T\) which denotes the number of test cases.

For each test case:

• The first line contains a single integer \(N\) representing the number of coins.
• The second line contains \(N\) space-separated integers representing the values of the coins.

Input is given via standard input (stdin).

outputFormat

For each test case, output a single line containing the maximum number of coins that can be showcased.

Output should be printed to standard output (stdout).

## sample

3
5
1 2 3 4 5
4
4 3 2 1
6
1 3 2 5 4 6

5
1
4

</p>