#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <chrono>
#include <random>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

int H, W;
VT<string> S;
PII p[2];

int main(void) {
    scanf("%d%d", &H, &W);
    S.resize(H);
    for_each(ALL(S), [](auto &e){cin >> e;});
    auto inside = [&](int h, int w) {
        0 <= h && h < H && 0 <= w && w < W;
    };
    int buf = 0;
    REP(i, H) REP(j, W) {
        if (S[i][j] == '*') {
            p[buf++] = MP(i, j);
        }
    }
    int h, w;
    if (p[0].first == p[1].first) { //h同じ
        w = p[0].second;
        h = p[1].first + 1;
        if (h >= H) h -= 2;
    } else if (p[0].second == p[1].second) { //w同じ
        h = p[0].first;
        w = p[1].second + 1;
        if (w >= W) w -= 2;
    } else {
        h = p[0].first;
        w = p[0].second + 1;
        if (w >= W) w -= 2;
    }
    S[h][w] = '*';
    for_each(ALL(S), [](auto &e){cout << e << endl;});
}