#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  ll h,w;cin >> h >> w;
  vector<string> g(h);rep(i,h)cin >> g[i];
  ll sx=-1,sy=-1;
  ll nsx=-1,nsy=-1;
  rep(i,h)rep(j,w){
    if(g[i][j]=='*'){
      if(sx==-1)sx=i,sy=j;
      else nsx=i,nsy=j;
    }
  }
  rep(k,4){
    ll nx=sx+dx[k],ny=sy+dy[k];
    if(nx<0||ny<0||nx>=h||ny>=w)continue;
    if(k%2==1){
      if(sy!=nsy)g[nx][ny]='*';break;
    }
    else{
      if(sx!=nsx)g[nx][ny]='*';break;
    }
  }
  rep(i,h)cout << g[i] << endl;

}