Longest Increasing Subarray

Given an array of integers representing risk scores, your task is to determine the length of the longest contiguous subarray where the scores are strictly increasing.

Formally, for an array \(A\) of length \(n\), find the maximum integer \(L\) such that there exists an index \(i\) with \(1 \leq i \leq n-L+1\) and \(A[i] < A[i+1] < \cdots < A[i+L-1]\). If the array is empty, the answer is 0.

You are given multiple test cases. For each test case, first you are given an integer \(n\) (the number of scores), followed by \(n\) integers representing the risk scores. Your program should output the answer for each test case on a new line.

inputFormat

The first line of input contains an integer \(T\) representing the number of test cases. The description of the test cases follows:

• The first line of each test case contains an integer \(n\) (the number of scores).
• The next line contains \(n\) space-separated integers representing the risk scores.

outputFormat

For each test case, output a single line containing the length of the longest contiguous strictly increasing subarray.

## sample

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

3
6
1

</p>