The meeting place cannot be changed#5069
Petro and Vasyl, two good friends, decided to play hide and seek in a maze. After a few hours, they got bored and decided to find each other as quickly as possible.
The maze has the shape of a rectangle and is divided into N \times M cells. Each cell contains either a wall or a passage. Petro and Vasyl can move from one cell to a neighboring one if the cells share a side. They cannot enter cells that contain a wall. Both boys can move simultaneously. Your task is to find a cell where Petro and Vasyl can meet in the minimum possible number of moves.
The first line contains two integers 1 \leq N, M \leq 100 — the dimensions of the maze. The next line contains four positive numbers: P_x, P_y, V_x, V_y — the coordinates of the cells where Petro and Vasyl start, respectively. It is guaranteed that neither of the boys starts on a wall (P_x, V_x — row numbers; P_y, V_y — column numbers). Then follow lines, each containing numbers: if the corresponding cell contains a wall, or if it is a passage.
Print two positive numbers X_m, Y_m — the coordinates of the cell where Petro and Vasyl can meet. If meeting is impossible, print . If there are several possible meeting places, output any of them.
Example 1