#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

vector<string>S;
int gcd(int a,int b) {
	if (a == 0 || b == 0)return 0;
	if (a%b == 0)return b;
	return gcd(b, a%b);
}

int main() {
	int h, w;
	cin >> h >> w;
	rep(i, 0, h) {
		string s;
		cin >> s;
		S.pb(s);
	}

	pair<int, int>vec;
	vector<pair<int, int>>v(2);
	int f = 0;
	rep(i, 0, h)rep(j, 0, w) {
		if (S[i][j] == '*') {
			v[f] = make_pair(i, j);
			f++;
		}
	}
	vec = make_pair(v[0].first-v[1].first, v[0].second - v[1].second);
	if (vec.first != 0 && vec.second != 0) {
		int temp = gcd(abs(vec.first), abs(vec.second));
		vec.first /= temp;
		vec.second /= temp;
	}

	int ok = 0;
	rep(i, 0, h) {
		rep(j, 0, w) {
			if (S[i][j] == '-') {
				pair<int, int>tempv1 = make_pair(i - v[0].first, j - v[0].second);
				if (tempv1.first != 0 && tempv1.second != 0) {
					int temp = gcd(abs(tempv1.first), abs(tempv1.second));
					tempv1.first /= temp;
					tempv1.second /= temp;
				}

				if ((tempv1.first == 0 && vec.first == 0) || (tempv1.second == 0 && vec.second == 0))continue;

				pair<int, int>tempv2 = make_pair(-tempv1.first, -tempv1.second);
				if (tempv1 != vec && tempv2 != vec) {
					S[i][j] = '*';
					ok = 1;
				}
			}
			if (ok)break;
		}
		if (ok)break;
	}
	
	rep(i, 0, h) {
		rep(j, 0, w) {
			cout << S[i][j];
		}
		cout << endl;
	}


	return 0;
}