// compile: g++ -o data data.cpp -O3 -std=gnu++20 -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -ggdb3 -fmax-errors=2 -DLOCAL
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) {_variables(#x);_print(x);}
#else
#define debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTINF (int)(9223372036854775807)
#define int long long
#define MAXN 200010

int N, M;
vector<pair<int, int>> dir;
vector<vector<int>> e;
vector<int> dis;
queue<int> q;

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    cin >> N >> M;
    int st = (int)sqrt(M);
    for (int i = -st; i <= st; ++i) {
        for (int j = -st; j <= st; ++j) {
            if (i*i + j*j == M) dir.push_back({i, j});
        }
    }
    e.resize(N*N);
    dis.assign(N*N, -1);
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            for (auto d: dir) {
                if (i+d.first<0 || j+d.second<0 || i+d.first>=N || j+d.second>=N) continue;
                e[i*N+j].push_back((i+d.first)*N + j+d.second);
            }
        }
    }
    q.push(0); dis[0] = 0;
    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (auto v: e[u]) {
            if (~dis[v]) continue;
            dis[v] = dis[u] + 1;
            q.push(v);
        }
    }
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < N; ++j) {
            cout << dis[i*N + j] << " \n"[j==N-1];
        }
    }

    return 0;
}