Maximum Parking Spaces

You are given T parking lots. For each parking lot, you are provided with the daily record of parking spaces available over M days. The record for a parking lot starts with an integer M followed by M space-separated integers, where each integer represents the number of available parking spaces on that day.

Your task is to determine the maximum number of parking spaces available on any single day for each parking lot.

Note: The input is provided via standard input (stdin) and the output should be written to standard output (stdout).

For example, if the input is:

2
3 10 0 15
4 8 8 8 16

Then the output should be:

15 16

inputFormat

The first line contains an integer T, which represents the number of parking lots. Each of the next T lines begins with an integer M (the number of days), followed by M space-separated integers. Each integer indicates the number of parking spaces available on that day.

outputFormat

Output T integers separated by spaces. Each integer should be the maximum number of parking spaces available for the corresponding parking lot.

## sample

1
3 10 0 15

15