#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
#include <set>
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define P pair<int,int>

#define MOD 1000000007
#define INF 2147483647
#define NINF (-2147483647-1)
#define LLINF 9223372036854775807
using ll = long long;
using namespace std;

int main() {
    int H, W,p=0;
    cin >> H >> W;
    P s[3];
    for (int i = 0; i < H; i++)
    {
        for (int j = 0; j < W; j++)
        {
            char c;
            cin >> c;
            if (c == '*') {
                s[p++] = P(i, j);
            }
        }
    }
    if (s[0].first == s[1].first) {
        if (s[0].first == 0) {
            s[2] = P(H - 1, s[0].second);
        }
        else {
            s[2] = P(0, s[0].second);
        }
    }
    else if (s[0].second == s[1].second) {
        if (s[0].second == 0) {
            s[2] = P(s[0].first, W-1);
        }
        else {
            s[2] = P(s[0].first, 0);
        }
    }
    else {
        s[2] = P(s[0].first, s[1].second);
    }
    for (int i = 0; i < H; i++)
    {
        for (int j = 0; j < W; j++)
        {
            if (i == s[0].first && j == s[0].second) {
                cout << "*";
            }
            else if (i == s[1].first && j == s[1].second) {
                cout << "*";
            }
            else if (i == s[2].first && j == s[2].second) {
                cout << "*";
            }
            else {
                cout << "-";
            }
        }
        cout << endl;
    }
    getchar(); getchar();
    return 0;
}