Card Shuffle (Small)

Frank likes card games and spends his weekends at a friend's house playing them. The deck they use has $M$ cards, each carrying a different number from 1 to $M$. Frank owns the same automatic card shuffling machine his friend uses, so he knows how it works. The machine shuffles the deck by cutting it $C$ times. The $i$-th cut takes $B_i$ cards starting at position $A_i$ from the top, that is, the cards at positions $A_i$ through $A_i + B_i - 1$, and moves them to the top of the deck keeping their order.

One day the old deck got dirty, so a new one came out. The new deck goes into the shuffling machine exactly as it comes, with the cards ordered 1 to $M$ from the top. Knowing how the machine behaves, Frank wants to work out which card sits at position $W$ from the top after the shuffle.

The first line holds a positive integer $T$, the number of test cases. Each test case then follows in this format.

M C W
A1 B1
...
AC BC

The first line holds three integers $M$, $C$, $W$ separated by single spaces, where $M$ is the number of cards, $C$ is the number of cuts, and $W$ is the position you are asked about. Each of the next $C$ lines holds two integers $A_i$, $B_i$ separated by a single space, meaning that the $i$-th cut moves the $B_i$ cards starting at position $A_i$ from the top to the top of the deck.

Constraints

• $1 \le T \le 200$
• $1 \le C \le 100$
• $1 \le W \le M$
• $1 \le A_i \le M$
• $1 \le B_i \le M$
• $1 \le A_i + B_i - 1 \le M$
• $1 \le M \le 100$

For each test case, print one line in this form.

Case #X: P

$X$ is the test case number starting from 1, and $P$ is the card at position $W$ from the top of the deck after the shuffle.