#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    auto t0 = chrono::high_resolution_clock::now();

    constexpr int N = 6;
    int a[2][N] = {}, b[N * N] = {};
    ll b1[N * N] = {};
    array<int, N * N> d;
    int v = -1;
    int q = N * N;
    mt19937_64 rnd;

    for (int k = 0; k < q; k++) {
        int t = 0;
        ll s = 0;
        for (int i = 0; i < N; i++) {
            int d;
            cin >> d;
            d--;
            t |= 1 << d;
            s += 1 << d * 8;
        }
        b[k] = ~t;
        b1[k] = s;
    }

    for (int l = 0;; l++) {
        if (l % 256 == 0) {
            auto t1 = chrono::high_resolution_clock::now();
            if (chrono::duration_cast<chrono::milliseconds>(t1 - t0).count() >= 100) {
                //cout << l << endl;
                //cout << v << endl;
                break;
            }
        }

        ll p[N][N] = {};
        array<int, N * N> c;
        for (int h = 0; h < 2; h++) {
            for (int i = 0; i < N; i++) {
                a[h][i] = (1 << N) - 1;
            }
        }
        for (int k = 0; k < q; k++) {
            int t = b[k];

            int i1 = -1, j1 = -1, u = 1 << 30;
            if (k < 10) {
                while (1) {
                    i1 = rnd() % N;
                    j1 = rnd() % N;
                    if (p[i1][j1] == 0) break;
                }
            } else {
                for (int i = 0; i < N; i++) {
                    for (int j = 0; j < N; j++) {
                        if (p[i][j] == 0) {
                            int s = (__builtin_popcount(a[0][i] & t) + __builtin_popcount(a[1][j] & t)) * 1024 - __builtin_popcount(a[0][i]) - __builtin_popcount(a[1][j]);
                            if (s < u) {
                                u = s;
                                i1 = i;
                                j1 = j;
                            }
                        }
                    }
                }
            }
            c[k] = i1 * N + j1;
            p[i1][j1] = b1[k];
            a[0][i1] &= ~t;
            a[1][j1] &= ~t;
        }

        int s = 0;
        for (int i = 0; i < N; i++) {
            ll t = 0;
            for (int j = 0; j < N; j++) {
                t += p[i][j];
            }
            for (int h = 0; h < 6; h++) {
                if (a[0][i] >> h & 1) s += (t >> h * 8 & 0xff) - 3;
            }
        }
        for (int j = 0; j < N; j++) {
            ll t = 0;
            for (int i = 0; i < N; i++) {
                t += p[i][j];
            }
            for (int h = 0; h < 6; h++) {
                if (a[1][j] >> h & 1) s += (t >> h * 8 & 0xff) - 3;
            }
        }
        if (s > v) {
            v = s;
            d = c;
        }
    }

    for (int k = 0; k < q; k++) {
        int i = d[k] / N;
        int j = d[k] % N;
        cout << i + 1 << ' ' << j + 1 << endl;
    }

    return 0;
}