Prozor

Young Marin, now already a respectable star of Croatian cinematography, spends his free time looking out the window. Unfortunately for him, the same activity is also taken up by a few flies that have landed on his window and are looking into the distance. Marin immediately hurried to get his square racket for killing flies. At the same time, he wondered how many flies it is possible to kill in one shot. After trying to scare away the flies unsuccessfully for a few hours, he decided to ask for your help.

Marin has sent you a picture of his window, the dimensions being $R \times S$ pixels and has also told you the length of the side of the racket he uses to kill the flies, in pixels. Your task is to determine the maximal amount of flies that Marin could have killed in a single shot and mark one such shot in the picture.

The first line of input contains three integers $R$, $S$ and $K$ ($3 \leq K \leq R$, $S \leq 100$) that denote the dimensions of Marin’s picture and the length of the side of the racket.

Each of the following $R$ lines contains $S$ characters that describe Marin’s
picture. The picture’s pixels marked with ‘`*`’ denote the position of a fly, whereas all
the other pixels are marked with ‘`.`’
and denote empty space. On his window, there is at least one
fly that Marin can kill with his racket.

The first line of output must contain the maximal number of flies Marin can kill in a single shot.

The following $R$ lines
must contain Marin’s picture, on it clearly marked a position
of the racket that will ensure Marin kills as many flies as
possible. The horizontal sides of the racket are denoted with a
series of characters ‘`-`’ and the
vertical ones with ‘`|`’, whereas
angles are denoted with ‘`+`’. For a
more detailed explanation, consult the sample tests.

Please note: Marin’s racket will affect only the flies located strictly inside the racket, and the racket must be located inside the window with all its parts. In other words, it is assumed that the flies located at the sides of the racket will have enough time to fly away.

Sample Input 1 | Sample Output 1 |
---|---|

3 5 3 ..... .*.*. ..... |
1 +-+.. |*|*. +-+.. |

Sample Input 2 | Sample Output 2 |
---|---|

7 6 4 ...... .*.*.* ...... .*.*.. ..*... ..*... *....* |
2 ...... .*.*.* +--+.. |*.|.. |.*|.. +--+.. *....* |

Sample Input 3 | Sample Output 3 |
---|---|

9 9 6 ***...... ......*.* .*....*.. ..*...*.. ..*.*.... ..*....*. .....*... .*...***. ......... |
6 ***...... ......*.* .*....*.. ..*+----+ ..*|*...| ..*|...*| ...|.*..| .*.|.***| ...+----+ |