#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
 
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define pi M_PI
 
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    int h, w;
    cin >> h >> w;
    vector<string> s(h);
    REP(i,h) cin >> s[i];
    int x1, y1, x2, y2;
    int f = 0;
    REP(i,h) REP(j,w){
        if (s[i][j] == '*'){
            if (f == 0){
                x1 = i;
                y1 = j;
                f = 1;
            }else{
                x2 = i;
                y2 = j;
            }
        }
    }
    int x, y;
    if (x1 == x2){
        y = y1;
        if (x1 == 0) x = 1;
        else x = 0;
    }else if (y1 == y2){
        x = x1;
        if (y1 == 0) y = 1;
        else y = 0;
    }else{
        x = x1;
        y = y2;
    }
    s[x][y] = '*';
    REP(i,h) cout << s[i] << endl;
    return 0;
}