#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int h, w;
    cin >> h >> w;
    string s[h];
    rep(i,h)cin >> s[i];
    int ax = -1, ay = -1;
    int bx = -1, by = -1;
    rep(i,h){
        rep(j,w){
            if(s[i][j] == '*'){
                if(ax == -1){
                    ax = i, ay = j;
                }else{
                    bx = i, by = j;
                }
            }
        }
    }

    int cx = -1, cy = -1;
    if(ax == bx){
        cx = (ax + 1) % h;
        cy = 0;
    }else if(ay == by){
        cx = 0;
        cy = (ay + 1) % w;
    }else{
        cx = ax;
        cy = by;
    }

    s[cx][cy] = '*';

    rep(i,h){
        cout << s[i] << endl;
    }

    return 0;
}