from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
from fractions import Fraction
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

h,w=MI()
ss=[list(SI()) for _ in range(h)]

st=[]
for i in range(h):
    for j in range(w):
        if ss[i][j]=="*":
            st.append((i,j))

for i,j in product(range(h),range(w)):
    v1=[i-st[0][0],j-st[0][1]]
    v2=[i-st[1][0],j-st[1][1]]
    if v1[0]*v2[1]==v1[1]*v2[0]:continue
    ss[i][j]="*"
    break

for r in ss:print("".join(r))