题目描述

$\textbf{Sokoban}$ is a famous puzzle game, where the player moves around in the $N \times M$-size grid, and pushes $1 \times 1$-size boxes to $1 \times 1$-size storage locations.

$\textbf{Bigger Sokoban}$ is a possible variation of Sokoban, but the size of boxes and storage locations are bigger than $1 \times 1$. This problem especially uses $2 \times 2$ for both.

The rule of Bigger Sokoban is the same as Sokoban. Each square in the grid is an empty square or a wall. Some $2 \times 2$ area of empty squares contain $2 \times 2$-size box each and some $2 \times 2$ area of empty squares are marked as $2 \times 2$-size storage location each.

The player is in the grid and may move up, down, left, right to the adjacent empty squares, but should not go through walls, boxes, or outside of the grid. If the player tries to move into a box, it is pushed to the adjacent squares in that direction. Boxes must not be pushed to other boxes, walls, or outside of the grid, and they cannot be pulled. The number of boxes is equal to the number of storage locations. The puzzle is solved when all boxes are at the storage locations.

Your mission is to make a Bigger Sokoban grid that needs at least $\textbf{40,000}$ moves to solve. To make the situation easier, the grid must satisfy the following constraints:

• $1 \leq N, \; M, \; N+M \leq 100$.
• The grid contains $\textbf{one}$ box and $\textbf{one}$ storage location.
• The player, the box, and the storage location must not intersect.

输入格式

There is no input for this problem.

输出格式

In the first line, print two space-separated integers $N, M$; they describe the size of the grid.

In each of the following $N$ lines, print a string of length $M$; it describes each row of the grid. Each string must consist of $\texttt{.}, \texttt{\#}, \texttt{P}, \texttt{B}, \texttt{S}$; each character means empty square, wall, player, box, storage location respectively.

The grid must contain exactly one $\texttt{P}$, exactly four $\texttt{B}$, and exactly four $\texttt{S}$. $\texttt{B}$ and $\texttt{S}$ each must form a $2 \times 2$ square. The grid, of course, must be solvable.

Note that the sample output is only to demonstrate a well-formatted output. Since it can be solved in less than 40,000 moves, it is not a correct answer.

<There are no inputs>

5 6
....SS
....SS
.#BB#.
..BB.P
......