Max Consecutive Increasing Days

You are given T test cases. For each test case, you are provided with an integer N which represents the number of days, followed by N integers representing the daily growth measurements of a plant.

Your task is to determine the maximum number of consecutive days during which the plant's growth was strictly increasing.

More formally, given a sequence \(a_1, a_2, \dots, a_N\), you need to find the maximum value of \(k\) such that there exists an index \(i\) (\(1 \le i \le N-k+1\)) with the property that \(a_i < a_{i+1} < \cdots < a_{i+k-1}\).

Print the result for each test case on a separate line.

inputFormat

The first line contains an integer T representing the number of test cases. For each test case, the first line contains an integer N denoting the number of days, followed by a line containing N space-separated integers representing the daily growth measurements.

outputFormat

For each test case, output a single integer representing the maximum number of consecutive days with strictly increasing growth. Each answer should be printed on a new line.## sample

2
7
3 2 10 5 7 8 6
5
1 2 3 4 5

3
5