#include<bits/stdc++.h>
//using namespace gnu_pbds;
using namespace std;

#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());

//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;


void c_a_r()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}


void solve()
{

    w(t)
    {

        loop(i, 1, n + 1)
        {
            loop(j, 1, m + 1)
            {
                if (a[i][j] == ' ' || a[i][j] == '#')
                {
                    if (i > K)
                    {
                        ll u = 0;
                        bool ok = 1, ok2 = 0;
                        for (ll k = i - 1; ((k >= 1) && (j - u - 1) >= 1 && (j + u + 1) <= m);
                                k--)
                        {
                            if (!((a[k][j - u - 1] == '*' || a[k][j - u - 1] == '#') &&
                                    (a[k][j + u + 1] == '*' || a[k][j + u + 1] == '#')))
                            {
                                ok = 0;
                                break;
                            }
                            ok2 = 1;
                            u++;
                        }
                        if (ok && ok2 && u >= K)
                        {
                            ll uu = 0;
                            a[i][j] = '#';
                            for (ll k = i - 1; uu < u && k >= 1; k--)
                            {
                                if (a[k][j - uu - 1] == '.'  a[k][j + uu + 1] == '.') break;
                                a[k][j - uu - 1] = '#';
                                a[k][j + uu + 1] = '#';
                                uu++;
                            }
                        }
                    }
                }
            }
        }

    }
}
int32_t main()
{
    c_a_r();

    solve();

}