Maximum Strength of the Wizard

You are given (T) test cases. For each test case, an integer (N) and an array (P = [p_1, p_2, \ldots, p_N]) representing the power levels of towers are provided. The wizard's strength is defined as the length of the longest contiguous subsequence where every subsequent tower's power is strictly higher than its previous one. Formally, for a contiguous subsequence (p_i, p_{i+1}, \ldots, p_{i+L-1}), it must satisfy [ p_i < p_{i+1} < \cdots < p_{i+L-1} ] Your task is to compute and output the maximum such (L) for each test case.

inputFormat

The first line contains an integer (T), the number of test cases. For each test case, the first line contains an integer (N), representing the number of towers. The second line contains (N) space-separated integers representing the power levels (p_1, p_2, \ldots, p_N).

outputFormat

For each test case, output a single integer on a new line, which is the maximum length of a contiguous subsequence of towers with strictly increasing power levels.## sample

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

3
1