// compile: make data
// run: ./data
#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...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
#else
#define debug(x...)
#define Debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define VI vector<int>
#define VII vector<vector<int>>
#define VIII vector<vector<vector<int>>>
#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 FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define double long double
#define int long long
#define MAXN 200010

const int dir[8][2] = {{2, 1}, {2, -1}, {1, 2}, {1, -2}, {-1, 2}, {-1, -2}, {-2, 1}, {-2, -1}};

int deg(vector<vector<int>> &vis, int x, int y) {
    int degree = 0;
    rep(i, 0, 8) {
        int nx = x + dir[i][0], ny = y + dir[i][1];
        if (nx < 0 || nx >= 8 || ny < 0 || ny >= 8 || vis[nx][ny]) continue;
        ++degree;
    }
    return degree;
}

int dfs(int x, int y, vector<vector<int>> &vis, int k) {
    vis[x][y] = k;
    if (k == 64) return 1;
    vector<pair<int, pair<int, int>>> v;
    rep(i, 0, 8) {
        int nx = x + dir[i][0], ny = y + dir[i][1];
        if (nx < 0 || nx >= 8 || ny < 0 || ny >= 8 || vis[nx][ny]) continue;
        v.push_back({deg(vis, nx, ny), {nx, ny}});
    }
    sort(v.begin(), v.end());
    for (auto [d, p] : v) if (dfs(p.first, p.second, vis, k + 1)) return 1;
    vis[x][y] = 0;
    return 0;
}

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

    int sx, sy; cin >> sy >> sx; --sx, --sy;
    vector<vector<int>> vis(8, vector<int>(8, 0));
    dfs(sx, sy, vis, 1);
    rep(i, 0, 8) {
        rep(j, 0, 8) cout << vis[i][j] << " \n"[j == 7];
    }

    return 0;
}