Problem Description

Yi Sima was one of the best counselors of Cao Cao. He likes to play a funny game himself. It looks like the modern Sudoku, but smaller.

Actually, Yi Sima was playing it different. First of all, he tried to generate a × board with every row contains  to , every column contains  to . Also he made sure that if we cut the board into four × pieces, every piece contains  to .

Then, he removed several numbers from the board and gave it to another guy to recover it. As other counselors are not as smart as Yi Sima, Yi Sima always made sure that the board only has one way to recover.

Actually, you are seeing this because you've passed through to the Three-Kingdom Age. You can recover the board to make Yi Sima happy and be promoted. Go and do it!!!

Input

The first line of the input gives the number of test cases, T(≤T≤). T test cases follow. Each test case starts with an empty line followed by  lines. Each line consist of  characters. Each character represents the number in the corresponding cell (one of '', '', '', ''). '*' represents that number was removed by Yi Sima.

It's guaranteed that there will be exactly one way to recover the board.

Output

For each test case, output one line containing Case #x:, where x is the test case number (starting from ). Then output  lines with  characters each. indicate the recovered board.

Sample Input

****

*

*

*

*

**

***

*

**

Sample Output

Case #:

Case #:

1243
4312
3421
2134
Case #:
3412
1234
2341

#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <stack>

#include <queue>

#include <vector>

using namespace std;

#define N 50

#define met(a,b) memset(a,b,sizeof(a));

vector<vector<int> >Q;

struct node

{

    int x,y;

}s[N];

char str[N][N];

int te;

int pan(int k,int n)

{

    for(int i=;i<;i++)///判断这个点的这一列是否出现过数字k

    {

        if(i==s[n].x)

            continue;

        if(str[i][s[n].y]-''==k)

            return ;

    }

    for(int i=;i<;i++)///判断这个点的这一行是否出现过数字k

    {

        if(i==s[n].y)

            continue;

        if(str[s[n].x][i]-''==k)

            return ;

    }

    for(int i=;i<=;i++)///判断包含这个点的2*2角落是否出现过数字k

    {

        for(int j=;j<=;j++)

        {

            int xx=s[n].x/*+i;

            int yy=s[n].y/*+j;

            if(xx==s[n].x && yy==s[n].y)

                continue;

            if(str[xx][yy]-''==k)

                return ;

        }

    }

    return ;

}

void dfs(int m)

{

    if(te==m)

    {

        for(int i=;i<;i++)

            puts(str[i]);

        return ;

    }

    for(int i=;i<=;i++)

    {

        if(pan(i,m))///判断数字i是否可以放在这个点上

        {

            str[s[m].x][s[m].y]=i+'';

            dfs(m+);

            str[s[m].x][s[m].y]='';

        }

    }

    return ;

}

int main()

{

    int t,con=;

    scanf("%d",&t);

    while(t--)

    {

        for(int i=;i<;i++)

        {

            scanf("%s",str[i]);

        }

        te=;

        for(int i=;i<;i++)

        {

            for(int j=;j<;j++)

            {

                if(str[i][j]=='*')///找哪几个点需要填数，一共多少个

                {

                    s[te].x=i;

                    s[te].y=j;

                    str[i][j]='';

                    te++;

                }

            }

        }

        printf("Case #%d:\n",con++);

        dfs();

    }

    return ;

}