#include <stdio.h>

void sort(int a[], int n)
{
    int i, j;
    for (i = 0; i < n - 1; i++){
        for (j = 0; j < n - i - 1; j++){
            if (a[j] > a[j + 1]){
                int tmp = a[j];
                a[j] = a[j + 1];
                a[j + 1] = tmp;
            }
        }
    }
}
int main()
{
    int zu = 0;
    int temp[20][9] = {};
    scanf("%d", &zu);
    for (int i = 0; i < zu; ++i){
        for (int k = 0; k < 9; ++k){
            scanf("%d", &temp[i][k]);
        }
    }

    for (int i = 0; i < zu; ++i){
        int cn[9];
        for (int k = 9; k-->0; cn[k] = temp[i][k]);
        sort(cn, 9);

        int d = 0;
        int idx2 = 1;
        for (; idx2 < 9; ++idx2){
            if (cn[idx2] == cn[idx2 - 1]) continue;
            d = cn[idx2]; break;
        }

        idx2 = 0;
        for (; idx2 < 9; ++idx2){
            if (temp[i][idx2] == d) break;
        }
        printf("a[%d][%d]=%d\n", idx2 / 3, idx2 % 3, d);
    }
    return 0;
}