Ash is training Pikachu for battles, for which Professor Oak has a designed a training arena where Ash could train Pikachu.
The arena has a special zone where Ash could train Pikachu to make high jumps.
A jump is considered high when Pikachu jumps to a taller wall.

The zone has several walls. Pikachu starts from the ground (height = 0). He has to jump to the adjacent walls one after another until he reaches to the last one.
You will be given heights of walls from left to right.
can you tell Ash the highest jump Pikachu has made?

For example, if the heights of the walls are 5 4 3 5 4, then, the maximum jump Pikachu will make will be 5(from the ground to the first wall)

INPUT
The first line contains a single integer T, the number of test cases.
For each test cases, there are 2 lines. The first contains an integer N, denoting the number of walls.
The second line contains N space-separated integers, denoting the heights of the walls.

OUTPUT
For each test case print, the highest jump Pikachu made in different lines.

CONSTRAINTS
1 <= T <= 100
1 <= N <= 1000
1 <= height of a wall <= 10000