The first line contains a single integer T, the number of test cases.

For each case,

The first line contains integer N, M.

The next M lines contain the operation in following form.

C a b x: place chess knight on cell(a,b), the value of the knight is x. (1<=a,b<=n, 1<=x<=100000)

It grants that cell(a,b) has no knight before the operation.

Q a b: answer the maximum value of knight which is connected with knight(a,b), include itself.

If cell (a,b)has no knight, just answer -1. A knight is directly connected with the knight on the left,

right, up and down. Two knights are connected if they have been directly connected or

interconnected through some other connected knights.

The initial chessboard is empty.