#pragma GCC optimize ("O3,inline,omit-frame-pointer,no-asynchronous-unwind-tables,fast-math")
#include <bits/stdc++.h>
#include <unordered_map>
#include <stdlib.h>
using namespace std;
#define rep(i, a, n) for(ll i = a; i < n; i++)
#define rrep(i, a, n) for(ll i = a; i >= n; i--)
#define inr(l, x, r) (l <= x && x < r)
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1LL<<60;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll n, k; cin >> n >> k;
    if(k == 0){
        cout << -1 << endl;
        return 0;
    }
    vector<vector<ll>> ans(n,vector<ll>(n));
    rep(i,0,k){
        ll num = n*n-k+i+1;
        ans[i/n][i%n] = num;
    }
    rep(i,0,n*n-k){
        ll num = i+k;
        ll x = num/n, y = num%n;
        ans[x][y] = i+1;
    }
    for(auto x: ans){
        for(auto y: x) cout << y << " ";
        cout << endl;
    }
    return 0;
}