370_D. Broken Monitor
Innocentius has a problem — his computer monitor has broken. Now some of the pixels are "dead", that is, they are always black. As consequence, Innocentius can't play the usual computer games. He is recently playing the following game with his younger brother Polycarpus.

Innocentius is touch-typing a program that paints a white square one-pixel wide frame on the black screen. As the monitor is broken, some pixels that should be white remain black. Polycarpus should look at what the program displayed on the screen and guess the position and size of the frame Innocentius has painted. Polycarpus doesn't like the game but Innocentius persuaded brother to play as "the game is good for the imagination and attention".

Help Polycarpus, automatize his part in the gaming process. Write the code that finds such possible square frame that:

  * the frame's width is 1 pixel, 
  * the frame doesn't go beyond the borders of the screen, 
  * all white pixels of the monitor are located on the frame, 
  * of all frames that satisfy the previous three conditions, the required frame must have the smallest size. 



Formally, a square frame is represented by such pixels of the solid square, that are on the square's border, that is, are not fully surrounded by the other pixels of the square. For example, if the frame's size is d = 3, then it consists of 8 pixels, if its size is d = 2, then it contains 4 pixels and if d = 1, then the frame is reduced to a single pixel.

Input

The first line contains the resolution of the monitor as a pair of integers n, m (1 ≤ n, m ≤ 2000). The next n lines contain exactly m characters each — the state of the monitor pixels at the moment of the game. Character "." (period, ASCII code 46) corresponds to the black pixel, and character "w" (lowercase English letter w) corresponds to the white pixel. It is guaranteed that at least one pixel of the monitor is white.

Output

Print the monitor screen. Represent the sought frame by characters "+" (the "plus" character). The pixels that has become white during the game mustn't be changed. Print them as "w". If there are multiple possible ways to position the frame of the minimum size, print any of them.

If the required frame doesn't exist, then print a single line containing number -1.

Examples

Input

4 8
..w..w..
........
........
..w..w..


Output

..w++w..
..+..+..
..+..+..
..w++w..


Input

5 6
......
.w....
......
..w...
......


Output

......
+w+...
+.+...
++w...
......


Input

2 4
....
.w..


Output

....
.w..


Input

2 6
w..w.w
...w..


Output

-1

Note

In the first sample the required size of the optimal frame equals 4. In the second sample the size of the optimal frame equals 3. In the third sample, the size of the optimal frame is 1. In the fourth sample, the required frame doesn't exist.
```python
#!/usr/bin/python3

def readln(): return list(map(int, input().split()))
import sys
def exit():
    print(-1)
    sys.exit()

n, m = readln()
mon = [list(input()) for _ in range(n)]
hor = [i for i in range(n) if mon[i] != ['.'] * m]
rmon = list(zip(*mon))
ver = [j for j in range(m) if rmon[j] != ('.',) * n]
mini = hor[0]
maxi = hor[-1]
minj = ver[0]
maxj = ver[-1]
cnt_in = len([1 for i in range(mini + 1, maxi) for j in range(minj + 1, maxj) if mon[i][j] == 'w'])
cnt_l = len([1 for i in range(mini + 1, maxi) if mon[i][minj] == 'w'])
cnt_r = len([1 for i in range(mini + 1, maxi) if mon[i][maxj] == 'w'])
cnt_d = len([1 for j in range(minj + 1, maxj) if mon[mini][j] == 'w'])
cnt_u = len([1 for j in range(minj + 1, maxj) if mon[maxi][j] == 'w'])
if cnt_in:
    exit()
if maxi - mini < maxj - minj:
    k = maxj - minj + 1
    if maxi == mini and cnt_d:
        if mini >= k - 1:
            mini -= k - 1
        elif maxi + k - 1 < n:
            maxi += k - 1
        else:
            exit()
    else:
        if not cnt_d:
            mini = max(0, maxi - k + 1)
        if maxi - maxi + 1 != k and not cnt_u:
            maxi = min(mini + k - 1, n - 1)
        if maxi - mini + 1 != k:
            exit()
else:
    k = maxi - mini + 1
    if maxj == minj and cnt_l:
        if minj >= k - 1:
            minj -= k - 1
        elif maxj + k - 1 < m:
            maxj += k - 1
        else:
            exit()
    else:
        if not cnt_l:
            minj = max(0, maxj - k + 1)
        if maxj - minj + 1 != k and not cnt_r:
            maxj = min(minj + k - 1, m - 1)
        if maxj - minj + 1 != k:
            exit()
for i in range(mini, maxi + 1):
    if mon[i][minj] == '.':
        mon[i][minj] = '+'
for i in range(mini, maxi + 1):
    if mon[i][maxj] == '.':
        mon[i][maxj] = '+'
for j in range(minj, maxj + 1):
    if mon[mini][j] == '.':
        mon[mini][j] = '+'
for j in range(minj, maxj + 1):
    if mon[maxi][j] == '.':
        mon[maxi][j] = '+'
print('\n'.join([''.join(row) for row in mon]))

```