#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define rep(i,a,n) for(int i=a; i=n; i--) #define pb(a) push_back(a) #define fr first #define sc second #define INF 2000000000 #define int long long int #define X real() #define Y imag() #define EPS (1e-10) #define EQ(a,b) (abs((a) - (b)) < EPS) #define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) ) #define LE(n, m) ((n) < (m) + EPS) #define LEQ(n, m) ((n) <= (m) + EPS) #define GE(n, m) ((n) + EPS > (m)) #define GEQ(n, m) ((n) + EPS >= (m)) typedef vector VI; typedef vector MAT; typedef pair pii; typedef long long ll; typedef complex P; typedef pair L; typedef pair C; int dy[]={0, 0, 1, -1}; int dx[]={1, -1, 0, 0}; int const MOD = 1000000007; namespace std { bool operator<(const P& a, const P& b) { return a.X != b.X ? a.X < b.X : a.Y < b.Y; } } signed main() { int h, w; cin >> h >> w; char board[110][110]; P st1 = P(-1, -1), st2 = P(-1, -1); rep(i,0,h) rep(j,0,w) { cin >> board[i][j]; if(board[i][j] == '*') { if(st1 == P(-1, -1)) { st1 = P(i, j); } else { st2 = P(i, j); } } } double d = abs(st1 - st2); bool ok = false; rep(i,0,h) rep(j,0,w) { if(ok) break; P point = P(i, j); if(point != st1 && point != st2) { double d1 = abs(st1 - point); double d2 = abs(st2 - point); double ma = max(d, max(d1, d2)); if(abs(2 * ma - (d + d1 + d2)) > EPS) { board[i][j] = '*'; ok = true; break; } } } rep(i,0,h) { rep(j,0,w) { cout << board[i][j]; if(board[i][j] == '*') { // printf("star: (%lld, %lld)\n", i, j); } } cout << endl; } return 0; }