#B4235. Hollow Square Pattern

    ID: 11892 Type: Default 1000ms 256MiB

Hollow Square Pattern

Hollow Square Pattern

In this problem, you are given two integers: the side length ( n ) of a large square and the side length ( m ) of a smaller square that is removed from the center of the large square, forming a hollow pattern. The inner square is exactly centered within the outer square. It is guaranteed that ( n > m ) and ( n - m ) is even.

inputFormat

The input consists of two integers ( n ) and ( m ) separated by space or newline. Here, ( n ) is the side length of the outer square and ( m ) is the side length of the inner (removed) square.

outputFormat

Print the resulting pattern using ( n ) lines. Each line must contain exactly ( n ) characters. Use '*' (asterisks) for the filled parts and a space character ' ' for the removed inner square area. There should be no extra spaces at the end of any line.

sample

5 1
*****



*****

</p>