uva 784

#include <iostream>
#include <queue>
#include <cstdio>

using namespace std;

string g[35];
int dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
struct node{
    int x, y;
};
int cnt;

void bfs(int x, int y){
    queue<node> q;
    node u, v;
    u.x = x;
    u.y = y;
    q.push(u);
    while(!q.empty()){
        u = q.front();
        q.pop();
        for(int i = 0; i < 4; ++i){
            v.x = u.x + dir[i][0], v.y = u.y + dir[i][1];
            if(v.x < 0 || v.x >= cnt || v.y < 0 || v.y >= g[v.x].size())
                continue;
            if(g[v.x][v.y] != ' ')
                continue;
            g[v.x][v.y] = '#';
            q.push(v);
        }
    }
}

int main()
{
    int T;
    cin >> T;
    getchar();   //注意这里，如果没有加，getline会读取一个空字符串；
    while(T--){
        cnt = 0;
        while(1){
            getline(cin, g[cnt++]);
            if(g[cnt-1][0] == '_')
                break;
        }
        for(int i = 0; i < cnt; ++i)
            for(int j = 0; j < g[i].size(); ++j)
                if(g[i][j] == '*'){
                    g[i][j] = '#';
                    bfs(i, j);
                }
        for(int i = 0; i < cnt; ++i)
            cout << g[i] << endl;
    }
    return 0;
}