Sharing Pepero 2

An $N$-row, $M$-column grid is given. . denotes an empty cell and # denotes a student. Place exactly one box of Pepero in every empty cell and choose its direction.

• A box directed - gives one chocolate Pepero to every student in its row.
• A box directed | gives one almond Pepero to every student in its column.

Other boxes and students do not block delivery. Determine whether every student can receive at least one chocolate Pepero and at least one almond Pepero, and construct such an assignment if possible.

The input is given in the following format:

$N\ M$ $S_1$ $S_2$

If no assignment exists, print NO. Otherwise, print YES, followed by $N$ lines of $M$ characters describing the assignment. Keep every original # unchanged and replace every original . with either - or |. If there are multiple solutions, print any of them.

• $1 \leq N,M \leq 2000$.
• Every character of $S_i$ is . or # ($1\le i\le$).