Video Clips

아직 제출이 없습니다시간 제한2초메모리 제한1024 MB

문제 설명

예제1

문제

On a popular web site, the $N$ KATT contestants can spend time watching video clips in between solving problems.

On the site, there are $K$ funny videos of cats jumping around on the keyboard, numbered between $0$ and $K - 1$ . When one of the videos has been viewed, a suggestion for the next funny cat video is shown, which you of course click on and start watching.

For each contestant, you will be given the initial cat video he or she views. Determine what the $M$ :th video that each contestant watches will be.

입력

The sample judge reads input in the following format:

line $1$ : K M
line $2$ : S[0] ... S[K - 1]
line $3$ : N: the number of calls made to clip(I).
line $4$ I1 ... IN: the parameters of the $N$ calls to clip(I).

출력

The sample judge will write $N$ lines with the return values of clip(I).

제한

$N, K \le 100\\,000$
$2 \le M \le 10^9$