Prison Break

A prison is built as a labyrinth. The labyrinth is made of huts, and every hut is marked + or *. Two huts are neighbors when they share a side. From a + hut the prisoner moves only to a neighboring + hut, and from a * hut only to a neighboring * hut.

The labyrinth is a rectangle of length $L$ and width $W$. A hut is identified by a horizontal position and a vertical position. Horizontal positions run from $1$ to $L$ starting at the left, and vertical positions run from $1$ to $W$ starting at the bottom.

Every hut of the labyrinth is an entry hut, but there is only one exit hut. You are given the labyrinth, the entry hut where the prisoner stands, and the exit hut. Decide whether the prisoner can reach the exit hut.

The first line contains the number of test cases $P$.

The first line of each test case contains six natural numbers $L$, $W$, $A$, $B$, $C$, $D$ separated by spaces.

• $L$ is the length of the labyrinth and $W$ is its width.
• $A$ and $B$ are the horizontal and vertical positions of the entry hut where the prisoner stands.
• $C$ and $D$ are the horizontal and vertical positions of the exit hut.

Then follow $W$ lines of $L$ characters each. Every character is + or *. The lines are given from the top of the labyrinth downward, so the $i$-th line describes the huts whose vertical position is $W+1-i$.

$1 \le P \le 20$, $1 \le L \le 500$, $1 \le W \le 500$, $1 \le A, C \le L$, $1 \le B, D \le W$, and the sum of $L \times W$ over all test cases is at most $250000$.

For each prison print YES if the prisoner can escape and NO otherwise, one answer per line.