#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    int m = n*n;
    
    if (k == 0) {
        puts("-1");
        return 0;
    }
    
    vector<int> p;
    for (int x = m-k+1; x >= 1; --x) p.push_back(x);
    for (int x = m-k+2; x <= m; ++x) p.push_back(x);
    
    rep(i, n)rep(j, n) cout << p[i*n+j] << " \n"[j == n-1];
    
    return 0;
}