import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const H = readInt();
      const W = readInt();
      auto S = new char[][H];
      foreach (x; 0 .. H) {
        S[x] = readToken().to!(char[]);
      }
      
      int[] xs, ys;
      foreach (x; 0 .. H) foreach (y; 0 .. W) {
        if (S[x][y] == '*') {
          xs ~= x;
          ys ~= y;
        }
      }
      assert(xs.length == 2);
      foreach (x2; 0 .. H) foreach (y2; 0 .. W) {
        if ((xs[1] - xs[0]) * (y2 - ys[0]) - (ys[1] - ys[0]) * (x2 - xs[0]) != 0) {
          S[x2][y2] = '*';
          foreach (x; 0 .. H) {
            writeln(S[x]);
          }
          goto found;
        }
      }
      assert(false);
     found:
    }
  } catch (EOFException e) {
  }
}