Pakkhu is a 3^rd year student of NIT, Bhopal and also a generous senior. He has a total of C coins with him today. Out of which he has organised a game for his intelligent juniors.

He gathers M juniors and makes all of them sit in a circle and assigns them an ID (1,2,3….M). Some c (1<=c<=C) coins are kept in the centre. Junior with ID P starts the game. Each player in his turn can pick atmost K coins (and minimum 1) from the centre. Let the player who in his turn picks all the coins left, has ID W. Points are then awarded in the following manner :

Junior with ID W gets M points

Junior with ID W+1 gets M-1 points

Junior with ID W+2 gets M-2 points

.

.

.

Junior with ID W-1 gets 1 point

(..because the juniors are sitting in a circle)

A total of R rounds like this will be played. Your job is to find the ID of the player who has the highest total points and his/her total points after all rounds have been played. If two players have the same points, then the player with lower ID will be declared as the winner. Assume that each junior makes every move so as trying to maximize his/her own points.

INPUT

• The first line of input contains a single integer T denoting the number of test cases.

• The first line of each test case contains 4 space separated integers - C, M, R, K.

• Next, R lines contain two space-separated integers - P, c.

OUTPUT

• The output of each test case will be two integers - ID of junior with maximum points, and his points at the end of R rounds.

CONSTRAINTS

• 1 $\le$ T $\le$ 100

• 1 $\le$ C $\le$ 10⁹

• 1 $\le$ M $\le$ 5*10³

• 1 $\le$ R $\le$ 3*10³

• 1 $\le$ K $\le$  10⁹

• 1 $\le$ P $\le$ M

• 1 $\le$  c $\le$  C