Give you a rectangular gird which is h cells high and w cells wide.
Each grid is black initially. You can turn some grids into white.
A grid A(x,y) is connected with grid B if the coordinate of B is (x+1, y),(x-1, y),(x, y+1) or (x, y-1).
And your task is to propose a plan of the gird which has exactly n connected components of black part.
If there is no valid plan containing n connected components of black part, output -1.

Three integers h, w, n as described above.

Print h rows and w columns, '#' represents a black grid and '*' represents a white grid, indicating your solution.

1 10 5

#*#*#*#*#*