Longest Contiguous Increasing Subarray

You are given T test cases. For each test case, you are given an integer N followed by an array of N integers. Your task is to find the length of the longest contiguous subarray in which every element is strictly greater than its previous element (i.e. the subarray is strictly increasing).

The problem can be formalized as follows:

$$\text{answer} = \max_{1 \leq i \leq N} \{\ell_i\}, $$

where \(\ell_i\) is the length of the increasing contiguous subarray ending at index \(i\). Note that a subarray is a contiguous portion of the array.

Input and output should be handled via standard input (stdin) and standard output (stdout) respectively.

inputFormat

The first line of the input contains an integer T, the number of test cases. For each test case, the first line contains an integer N, representing the number of elements in the array. The second line contains N space-separated integers representing the elements of the array.

outputFormat

For each test case, print a single integer on a new line which is the length of the longest contiguous strictly increasing subarray.

## sample

3
6
1 3 2 3 4 5
4
15 12 20 22
5
1 2 3 4 5

4
3
5

</p>