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

using pii = pair<int,int>;
using ll = long long;
#define rep(i, j) for(int i=0; i < (int)(j); i++)
#define repeat(i, j, k) for(int i = (j); i < (int)(k); i++)
#define all(v) v.begin(),v.end()
#define debug(x) cerr << #x << " : " << x << endl

template<class T> bool set_min(T &a, const T &b) { return a > b  ? a = b, true : false; }
template<class T> bool set_max(T &a, const T &b) { return a < b  ? a = b, true : false; }
// vector
template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }
template<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << "\t" << t; return os << endl; }
// pair
template<class T, class U> ostream& operator << (ostream &os , const pair<T, U> &v) { return os << "<" << v.first << ", " << v.second << ">"; }

const int INF = 1 << 30;
const ll INFL = 1LL << 60;


class Solver {
  public:
    bool solve() {
        int H, W; cin >> H >> W;
        vector<string> G(H); cin >> G;
        vector<int> xs, ys;
        rep(y, H) rep(x, W) {
            if(G[y][x] == '*') {
                ys.push_back(y);
                xs.push_back(x);                
            }
        }
        assert(xs.size() == 2);
        int vx = xs[1] - xs[0];
        int vy = ys[1] - ys[0];
        rep(y, H) rep(x, W) {
            int ax = x - xs[0];
            int ay = y - ys[0];
            int cross = ax * vy - vx * ay;
            if(cross != 0) {
                G[y][x] = '*';
                goto OK;
            }
        }
        assert(0);
  OK:
        rep(y, H) cout << G[y] << endl;
        
        return 0;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    Solver s;
    s.solve();
    return 0;
}