#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define mod 1000000007;

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

int H, W;
char field[110][110];

int main()
{
	cin >> H >> W;

	int s1_x = -1, s1_y, s2_x, s2_y;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			cin >> field[i][j];
			if (field[i][j] == '*') {
				if(s1_x==-1)
					s1_x = j, s1_y = i;
				else
					s2_x = j, s2_y = i;
			}
		}
	}
	bool flag = true;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			if (flag) {
				if (s1_x != s2_x) {
					if (s1_y != i && s1_x == j) {
						cout << '*';
						flag = false;
					}
					else
						cout << field[i][j];
				}
				else if (s1_y != s2_y) {
					if (s1_x != j && s1_y == i) {
						cout << '*';
						flag = false;
					}
					else
						cout << field[i][j];
				}
				else
					cout << field[i][j];
			}
			else
				cout << field[i][j];
		}
		cout << endl;
	}
	return 0;
}