#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

string sky[110];

int cross(int x1, int y1, int x2, int y2){
    return x1 * y2 - x2 * y1;
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int H, W;
    std::cin >> H >> W;

    vector<P> stars;
    
    for(int i=0;i<H;++i){
        std::cin >> sky[i];

        for(int j=0;j<W;++j){
            if(sky[i][j] == '*'){
                stars.emplace_back(i, j);
            }
        }
    }

    bool ok = false;
    for(int i=0;i<H&&!ok;++i){
        for(int j=0;j<W;++j){
            if(sky[i][j] == '*'){
                continue;
            }

            int c = cross(fst(stars[0]) - i, snd(stars[0]) - j, fst(stars[1]) - i, snd(stars[1]) - j);
            
            if(c == 0){
                continue;
            }

            sky[i][j] = '*';
            ok = true;
            break;
        }
    }

    for(int i=0;i<H;++i){
        std::cout << sky[i] << std::endl;
    }
}