#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long int ll;
using namespace std;
const int mod=1e9+7;

int H,W;
string s[110];
pair<int,int> pr[2];
int main(){
    cin>>H>>W;
    bool f=false;
    REP(i,0,H){
        cin>>s[i];
        REP(j,0,W){
            if(s[i][j]=='*'){
                pr[f]={i, j};
                f=true;
            }
        }
    }
    f=false;
    REP(i,0,H){
        REP(j,0,W){
            if(s[i][j]=='*') continue;
            if((pr[0].F-i)*(pr[1].S-j)!=(pr[1].F-i)*(pr[0].S-j)){
                s[i][j]='*';
                f=true;
                break;
            }
        }
        if(f){
            break;
        }
    }
    REP(i,0,H){
        p(s[i]);
    }
    return 0;
}