#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n, k;
  cin >> n >> k;
  if (k == 0)
  {
    cout << -1 << endl;
    return 0;
  }
  vector<vector<int>> a(n, vector<int> (n));
  int id = k;
  for (int i = 0; i < n * n; ++i)
  {
    int x = ((id + i) / n) % n, y = (id + i) % n;
    a[x][y] = i + 1;
  }
  for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) cout << a[i][j] << " \n"[j == n - 1];
}