#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, k; cin >> n >> k;
	if (k == 0) {
		cout << -1 << endl;
		return 0;
	}
	vector a(n, vector<int>(n));
	vector<int>b;
	rep(i, k)b.push_back(n * n - k + i);
	rep(i, n * n - k)b.push_back(i);
	int idx = 0;
	rep(i, n * 2) {
		rep(x, i + 1) {
			int y = i - x;
			if (x >= n || y >= n)continue;
			a[x][y] = b[idx];
			idx++;
		}
	}
	rep(i, n) {
		rep(j, n)cout << a[i][j] + 1 << " ";
		cout << endl;
	}
	return 0;
}