Strictly Increasing Sequence Checker

You are given several test cases, each containing a list of integers. Your task is to determine whether the list is strictly increasing, i.e., each element is strictly less than the next one. Note that an empty list or a list with a single element is also considered strictly increasing.

Input: The input is provided via STDIN.

Output: For each test case, output a single line with true if the list is strictly increasing, otherwise output false.

The solution should follow the input/output conventions used in competitive programming.

The mathematical condition for a list \(a_1, a_2, \dots, a_n\) to be strictly increasing is:

[ a_1 < a_2 < \cdots < a_n ]

inputFormat

The first line contains an integer \(T\) denoting the number of test cases. Each test case is described as follows:

• The first line contains an integer \(N\), the number of elements in the list.
• The second line contains \(N\) space-separated integers.

If \(N = 0\), then the test case has an empty list.

outputFormat

For each test case, output a single line containing true if the list is strictly increasing, otherwise output false.

## sample

3
5
1 2 3 4 5
4
5 5 10 15
3
10 20 30

true
false
true

</p>