#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

struct Point {
    Point(){};
    Point( int a, int b ){ x = a; y = b; };
    int x;
    int y;
};

bool isOK( Point p1, Point p2, Point p3 ) {
    return !(abs(p1.x-p2.x)*abs(p2.y-p3.y) == abs(p2.x-p3.x)*abs(p1.y-p2.y));
}

int main() {
    int H,W;
    cin >> H >> W;
    vector<string> V(H);    
    for ( int i = 0; i < H; i++ ) {
        cin >> V[i];
    }
    Point P[2];
    int a = 0;
    for ( int y = 0; y < H; y++ ) {
    for ( int x = 0; x < W; x++ ) {
        if ( V[y][x] == '*' ) {
            Point p(x,y);
            P[a] = p;
            a++;
        }
    }
    }
    Point p;
    for ( int y = 0; y < H; y++ ) {
    for ( int x = 0; x < W; x++ ) {
        p.x = x; p.y = y;
        if ( isOK(p,P[0],P[1]) ) {
            V[y][x] = '*';
            goto ok;
        }
    }
    }
    ok:    
    for ( int y = 0; y < H; y++ ) {
        cout << V[y] << endl;
    }

    return 0;
}