#include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define printV(_v) for(auto _x:_v){cout<<_x<<" ";}cout<<endl
#define printVS(_vs) for(auto _x : _vs){cout << _x << endl;}
#define printVV(_vv) for(auto _v:_vv){for(auto _x:_v){cout<<_x<<" ";}cout<<endl;} cout << endl;
#define printP(_p) cout << _p.first << " " << _p.second << endl
#define printVP(_vp) for(auto _p : _vp) printP(_p);

typedef long long ll;
typedef pair<int, int> Pii;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
const int inf = 1e9;
const int mod = 1e9 + 7;

typedef complex<double> P;

double cross(P a, P b) {
    return imag(conj(a) * b);
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int h, w;
    cin >> h >> w;
    vector<string> s(h);
    vector<P> p;
    rep(i, h) {
        cin >> s[i];
        rep(j, w) {
            if (s[i][j] == '*') {
                p.emplace_back(i, j);
            }
        }
    }

    vector<P> q;
    q.emplace_back(0, 0);
    q.emplace_back(h-1, 0);
    q.emplace_back(h-1, w-1);
    q.emplace_back(0, w-1);
    rep(k, 4) {
        if (cross(p[0] - q[k], p[1] - q[k]) != 0) {
            s[(int)q[k].real()][(int)q[k].imag()] = '*';
            break;
        }
    }

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


}