import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write #import pypyjit #pypyjit.set_param('max_unroll_recursion=-1') #sys.set_int_max_str_digits(10**9) H,W=map(int,readline().split()) X,Y=[],[] S=[list(readline().rstrip()) for h in range(H)] for h in range(H): for w in range(W): if S[h][w]=="*": X.append(h) Y.append(w) for x in range(H): for y in range(W): if (X[0]-x)*(Y[1]-y)+(X[1]-x)*(Y[0]-y): S[x][y]="*" break else: continue break for s in S: print(*s,sep="")