Theater Seating

A theater has seats arranged in a rectangle: an odd number of seats per row, the width $W$ ($11 \le W \le 101$), and $R$ rows ($4 \le R \le 50$). Within a row the seats are numbered $1$ to $W$ from left to right (as seen from the stage), and the rows are numbered $1$ to $R$ starting from the row closest to the stage. Adjacent seats in the same row are one unit apart, and this spacing equals the distance between a seat and the seat directly in front of or behind it in an adjacent row. So seat $s$ in row $r$ occupies the grid point $(s, r)$.

Tickets are sold online with automatic seat assignment, so every seat is given a unique priority, where priority $1$ is the best. Priorities are assigned by these rules:

1. The middle seat of row $1$ (the row closest to the stage), at position $\left(\frac{W+1}{2},\ 1\right)$, gets the best priority, $1$.
2. Every other seat is ranked by its Euclidean distance to that best seat: the closer a seat is, the better (smaller) its priority.
3. Among seats that are exactly the same distance away, a seat in a row closer to the stage (a smaller row number) gets the better priority.
4. Among seats that are the same distance away and in the same row, the seat closer to seat number $1$ (the left-most seat) gets the better priority.

Because $(x, y)$ is unique for every seat, these rules assign a distinct priority to each of the $W \cdot R$ seats. Write a program that prints the resulting priority chart for a given width and number of rows.

The only line contains two space-separated integers $W$ and $R$, where $W$ is odd, $11 \le W \le 101$, and $4 \le R \le 50$.

Print $R$ lines. For $i = 1, 2, \ldots, R$, line $i$ contains the $W$ priorities of the seats in row $R - i + 1$, listed from seat $1$ to seat $W$ and separated by single spaces. In other words, print the rows from the back of the theater (row $R$) down to the front row (row $1$).