Score : $200$ points

问题描述

有 $N$ 个正方形，按照从左到右的顺序依次编号为 Square $1$, Square $2$, …, Square $N$。

同时，存在 $K$ 个棋子。从左边数起第 $i$ 个棋子最初被放在 Square $A_i$ 上。

接下来，我们将对这些棋子执行 $Q$ 次操作。第 $i$ 次操作如下：

• 如果从左边数起第 $L_i$ 个棋子已经在它最右侧的正方形上，则不执行任何操作。
• 否则，如果右侧相邻的正方形上没有棋子，则将从左边数起第 $L_i$ 个棋子向右移动一个正方形；如果有棋子，则不执行任何操作。

请在所有 $Q$ 次操作结束后，分别输出从左边数起第 $i=1,2,\ldots,K$ 个棋子所在的正方形的编号。

以上为通义千问 qwen-max 翻译，仅供参考。

Problem Statement

There are $N$ squares, indexed Square $1$, Square $2$, …, Square $N$, arranged in a row from left to right.
Also, there are $K$ pieces. The $i$-th piece from the left is initially placed on Square $A_i$.
Now, we will perform $Q$ operations against them. The $i$-th operation is as follows:

• If the $L_i$-th piece from the left is on its rightmost square, do nothing.
• Otherwise, move the $L_i$-th piece from the left one square right if there is no piece on the next square on the right; if there is, do nothing.

Print the index of the square on which the $i$-th piece from the left is after the $Q$ operations have ended, for each $i=1,2,\ldots,K$.

Constraints

• $1\leq K\leq N\leq 200$
• $1\leq A_1<A_2<\cdots<A_K\leq N$
• $1\leq Q\leq 1000$
• $1\leq L_i\leq K$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

$N$ $K$ $Q$

$A_1$ $A_2$ $\ldots$ $A_K$

$L_1$ $L_2$ $\ldots$ $L_Q$

Output

Print $K$ integers in one line, with spaces in between. The $i$-th of them should be the index of the square on which the $i$-th piece from the left is after the $Q$ operations have ended.

Sample Input 1

5 3 5
1 3 4
3 3 1 1 2

Sample Output 1

2 4 5

At first, the pieces are on Squares $1$, $3$, and $4$. The operations are performed against them as follows:

• The $3$-rd piece from the left is on Square $4$. This is not the rightmost square, and the next square on the right does not contain a piece, so move the $3$-rd piece from the left to Square $5$. Now, the pieces are on Squares $1$, $3$, and $5$.
• The $3$-rd piece from the left is on Square $5$. This is the rightmost square, so do nothing. The pieces are still on Squares $1$, $3$, and $5$.
• The $1$-st piece from the left is on Square $1$. This is not the rightmost square, and the next square on the right does not contain a piece, so move the $1$-st piece from the left to Square $2$. Now, the pieces are on Squares $2$, $3$, and $5$.
• The $1$-st piece from the left is on Square $2$. This is not the rightmost square, but the next square on the right (Square $3$) contains a piece, so do nothing. The pieces are still on Squares $2$, $3$, and $5$.
• The $2$-nd piece from the left is on Square $3$. This is not the rightmost square, and the next square on the right does not contain a piece, so move the $2$-nd piece from the left to Square $4$; Now, the pieces are still on Squares $2$, $4$, and $5$.

Thus, after the $Q$ operations have ended, the pieces are on Squares $2$, $4$, and $5$, so $2$, $4$, and $5$ should be printed in this order, with spaces in between.

Sample Input 2

2 2 2
1 2
1 2

Sample Output 2

1 2

Sample Input 3

10 6 9
1 3 5 7 8 9
1 2 3 4 5 6 5 6 2

Sample Output 3

2 5 6 7 9 10

update @ 2024/3/10 10:54:59