#936 Sharing Pepero

Statement

Statement language

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 Pepero to every student in its row.
A box directed | gives one Pepero to every student in its column.

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

Input

The input is given in the following format:

$N\ M$ $S_1$ $S_2$

Output

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.

Constraints

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

Subtasks

#	Score	Constraints
1	20	$N M \leq 16$ .
2	80	No additional constraints.

Samples

Sample 1

Input

2 2
.#
#.

Output

YES
-#
#-

Sample 2

Input

1 1
#

Output

NO