#include "bits/stdc++.h"
#define _CRT_SECURE_NO_WARNINGS
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define mp(a,b) make_pair(a,b)
using namespace std;typedef long long ll;typedef unsigned long long ull;int dx[] = { 1, -1 , 0 , 0};int dy[] = { 0,  0,  1, -1};

void solve() {
  int h,w;
  vector<pair<int,int> > p;
  cin >> h >> w;
  vector<string> vec(h);
  rep(i,h){
    cin >> vec[i];
    rep(j,w){
      if(vec[i][j] == '*'){
	p.push_back(make_pair(i,j));
      }
    }
  }
  int nx,ny;
  if(p[0].first == p[1].first){
    if(p[0].first + 1 < h){
      nx = p[0].second;
      ny = p[0].first+1;
    }else if(p[0].first - 1 >= 0){
      nx = p[0].second;
      ny = p[0].first-1;
    }
  }else if(p[0].second == p[1].second){
    if(p[0].second + 1  < w){
      nx = p[0].second+1;
      ny = p[0].first;
    }else if(p[0].second - 1 >= 0){
      nx = p[0].second-1;
      ny = p[0].first;
    }
  }else{
    nx = p[0].second;
    ny = p[1].first;
  }
  vec[ny][nx] = '*';
  rep(i,h){
    P(vec[i]);
  }
}

int main() {
	solve();
	return 0;
}