Shuffle Machine

Taejun bought a card shuffling machine to play card games with his friends. Wanting to win every game, Taejun analyzes the machine's structure to predict the shuffle results.

The machine has $M$ built-in shuffle techniques. The $i$-th shuffle technique is represented by a sequence $S_i$ of length $N$ in which each number from $1$ to $N$ appears exactly once. When the $i$-th shuffle technique is run once, the card at position $j$ from the top moves to position $S_{ij}$ from the top.

When the machine is started, it performs $K$ shuffles in the given order and then stops. Each shuffle is given by two integers $X_i$ and $Y_i$, which means that shuffle technique $X_i$ is run $Y_i$ times.

Initially, the cards are sorted from $1$ to $N$ from top to bottom. After the machine is started, find the final arrangement of the cards.

The first line contains $N$, $M$, and $K$, separated by spaces.

In each of the next $M$ lines, the $i$-th line contains $S_{i1}, S_{i2}, \cdots, S_{iN}$ in order, separated by spaces, which represent the $i$-th shuffle technique.

In each of the next $K$ lines, the $i$-th line contains the number $X_i$ of the shuffle technique to run in the $i$-th shuffle and the number of times $Y_i$ to run it, separated by a space.

Print the final order of the cards from top to bottom after the machine is started.

• All given numbers are integers.
• $2 \leq N \leq 1\,000$
• $1 \leq M \leq 1\,000$
• $1 \leq K \leq 1\,000$
• Each of $S_{i1}, S_{i2}, \cdots, S_{iN}$ contains each number from $1$ to $N$ exactly once. ($1 \leq i \leq M$)
• $1 \leq X_i \leq M$ ($1 \leq i \leq K$)
• $1 \leq Y_i \leq 10^9$ ($1 \leq i \leq K$)