Problem Statement

There are $N$ pieces placed at integer coordinates on a number line. The coordinate of the $i$-th piece is $X_i$.

Let us move these pieces $M$ times as follows.

• In the $i$-th move, given a positive integer $D_i$, we move each piece as follows.
• A piece whose coordinate is a negative integer is moved a distance of $D_i$ in the positive direction.
  • A piece whose coordinate is $0$ is not moved.
  • A piece whose coordinate is a positive integer is moved a distance of $D_i$ in the negative direction.

Determine whether each piece arrives at the origin. If it does, print the number of moves after which it arrives there for the first time. Otherwise, print its coordinate after the $M$ moves.

Constraints

• $1\leq N\leq 3\times 10^5$
• $1\leq M\leq 3\times 10^5$
• $1\leq X_1 < \cdots < X_N \leq 10^6$
• $1\leq D_i \leq 10^6$

Input

The input is given from Standard Input in the following format:

N M
X_1 \ldots X_N
D_1 \ldots D_M

Output

Print $N$ lines. The $i$-th line should describe the $i$-th piece in the following format.

If the piece arrives at the origin, let $x$ be the number of moves after which it arrives there for the first time, and print the following:

Yes x

If the piece does not arrive at the origin, let $x$ be its coordinate after the $M$ moves, and print the following:

No x