Grand Parade

Gru wants to hold a grand parade. The main part of the parade is a formation of his mighty army of minions.

The parade takes place on the Central Square, a square with side length $n$ meters. The square is split into cells of one meter by one meter, so it has $n^2$ cells. In other words, the Central Square is an $n \times n$ matrix.

Gru gave each minion in his army a colored T-shirt with a prime number printed on it. Some T-shirts may show the same number. Now the minions must line up the way Gru wants. Each cell of the square holds exactly one minion.

The formation has two more requirements. First, the parade must include minions whose T-shirts show exactly $k$ distinct prime numbers. Second, the product of the numbers on the T-shirts in each row and in each column must have the same number of divisors. Gru has only T-shirts with primes not exceeding $10^7$.

Build a formation that meets all requirements, or determine that it is impossible.

The only line contains two integers $k$ and $n$ ($1 \le k \le 10^9$, $1 \le n \le 1000$), the number of required distinct primes and the size of the square.

Print an $n \times n$ matrix of primes not exceeding $10^7$ that satisfies all requirements. If it is impossible, print -1.

In the first sample, the row products are 6 and 35, and the column products are 10 and 21. Each of these numbers has 4 divisors. In the second sample, the products of the first row, the third row, the first column, and the third column are 12, while the second row and second column products are 18. Both numbers have 6 divisors each. The third sample is impossible.