#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
	for (int i = 0; i < 6; i++) {
		for (int j = 0; j < 6; j++) {
			int n = 6, x = j, y = i;
			int m = min({ x, y ,(n - x - 1),(n - y - 1) });
			int ans = m * (n - m) * 4;
			x -= m, y -= m;
			if (y == 0) {
				cout << ans + x << " ";
			}
			else if (x == 0) {
				cout << ans + (n - m * 2 - 1) * 4 - y << " ";
			}
			else if (x < y) {
				cout << ans + (n - m * 2 - 1) * 3 - x << " ";
			}
			else {
				cout << ans + (n - m * 2 - 1) + y << " ";
			}
		}
		cout << endl;
	}
	return 0;
	int q;
	cin >> q;
	for (int i = 0; i < q; i++) {
		int n, x, y;
		cin >> n >> y >> x;
		int m = min({ x, y ,(n - x - 1),(n - y - 1) });
		int ans = m * (n - m) * 4;
		x -= m, y -= m;
		if (y == 0) {
			cout << ans + x << endl;
		}
		else if (x == 0) {
			cout << ans + (n - m * 2 - 1) * 4 - y << endl;
		}
		else if (x < y) {
			cout << ans + (n - m * 2 - 1) * 3 - x << endl;
		}
		else {
			cout << ans + (n - m * 2 - 1) + y << endl;
		}
	}
}