#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

#define FOR(i,a,b) for(ll i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair

bool star[101][101] = {}, flag = false;
int h, w;
pair<int, int> s1, s2;

int main() {
	cin >> h >> w;
	string str;
	for(int i = 0;i < h;i++){
		cin >> str;
		for(int j = 0;j < w;j++){
			if(str[j] == '*'){
				star[j][i] = true;
				if(flag){
					s2 = MP(j, i);
				}else{
					s1 = MP(j, i);
					flag = true;
				}
			}
		}
	}

	if(s1.first == s2.first && s1.first == 0){
		star[w - 1][0] = true;
	}else if(s1.second == s2.second && s1.second == 0){
		star[0][h - 1] = true;
	}else if(s1.second != 0 && s2.second != 0 &&
	s1.first / s1.second == s2.first / s2.second &&
	s1.first % s1.second == 0 && s2.first % s2.second == 0){
		star[w - 1][0] = true;
	}else{
		star[0][0] = true;
	}

	for(int i = 0;i < h;i++){
		for(int j = 0;j < w;j++){
			if(star[j][i]) cout << "*";
			else cout << "-";
		}
		cout << endl;
	}



	return 0;
}