Under construction

Still being built. Things may change

Rhombus

Time limit1sMemory limit1024 MB

Summary
Given an odd n and a range [a, b], print an n by n grid marking with * the cells whose Manhattan distance from the center is between a and b.
Level

Easy2 of 10

Topics
Implementation, Simulation
Solved
No attempts yet

Statement

A square grid of size n×nn \times n is given, where n=2k+1n = 2k+1 is odd. The center of the grid is the cell (k+1,k+1)(k + 1, k + 1). The distance between two cells (x1,y1)(x_1, y_1) and (x2,y2)(x_2, y_2) is ∣x1−x2∣+∣y1−y2∣|x_1 - x_2| + |y_1 - y_2|.

A rhombus with parameters (a,b)(a, b) is the set of cells whose distance from the center is between aa and bb, inclusive.

Given nn, aa, and bb, draw the rhombus.

Input

The first line contains an integer nn (1≤n≤2011 \le n \le 201, nn is odd). The second line contains an integer aa. The third line contains an integer bb (0≤a≤b0 \le a \le b, and if n=2k+1n = 2k+1, then b≤k+1b \le k + 1).

Output

Print nn lines, each with nn characters. A cell that belongs to the rhombus is printed as *, and a cell that does not is printed as ..

Examples1

  1. Example 1

    Input
    9
    2
    3
    
    Expected output
    .........
    ....*....
    ...***...
    ..**.**..
    .**...**.
    ..**.**..
    ...***...
    ....*....
    .........