#C9682. Maximum Magical Power
Maximum Magical Power
Maximum Magical Power
You are given several test cases. In each test case, you are provided with an integer N and a list of integers. Your task is to compute the maximum magical power from the first N numbers in the list.
In other words, given an array A and an integer N, you must output the value:
(\max{A_1, A_2, \dots, A_N})
Note: Although the input array may contain more than N integers, only the first N integers should be considered.
inputFormat
The first line of the input contains a single integer T denoting the number of test cases.
Each test case consists of two lines:
- The first line contains an integer N.
- The second line contains a space-separated list of integers. It is guaranteed that there are at least N integers.
Input is read from stdin.
outputFormat
For each test case, output the maximum value among the first N integers in the corresponding list.
Each result should be printed on a new line. Output is sent to stdout.
## sample3
5
4 12 7 15 9
2
100 250 150
3
3 1 4 1 5 9 2 6 5
15
250
4
</p>