Message Processing Verification

You are given multiple test cases. In each test case, a node receives a list of message timestamps. The node can process messages correctly only if the timestamps are in strictly increasing order. In other words, for a sequence of timestamps \(a_1, a_2, \ldots, a_n\), the node processes them correctly if and only if \(a_1 < a_2 < \cdots < a_n\). Otherwise, it cannot process the messages.

Your task is to check whether the sequence of timestamps for each test case is strictly increasing. For each test case, output "YES" if the condition is satisfied, or "NO" otherwise.

inputFormat

The first line of input contains a single integer \(T\) representing the number of test cases. Each test case consists of the following two lines:

• The first line contains an integer \(n\) representing the number of timestamps.
• The second line contains \(n\) space-separated integers representing the timestamps.

If \(n = 0\), the timestamp list will be empty. Assume that an empty list is considered valid and should output "YES".

outputFormat

For each test case, output a single line containing "YES" if the timestamps are strictly increasing, otherwise output "NO".

## sample

3
5
1 2 3 4 5
4
10 9 5 6
3
100 101 102

YES
NO
YES

</p>