#include <bits/stdc++.h>
using namespace std;

#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y

#define ASSERT(expr...) assert((expr))

using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;

using f32 = float;
using f64 = double;
// }}}

constexpr i64 INF = 1'010'000'000'000'000'017LL;

constexpr i64 MOD = 998244353LL;

constexpr f64 EPS = 1e-12;

constexpr f64 PI = 3.14159265358979323846;

#define M5 100007
#define M9 1000000000

#define F first
#define S second

// util {{{
#define FOR(i, start, end) for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)

#define all(x) (x).begin(), (x).end()
#define ll long long int
#define VI vector<ll>
#define VVI vector<VI>

#define ISD true
#define debug(x) \
    if (ISD)     \
    cout << #x << ": " << x << endl

template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {})
{
    if (comp(xmax, x))
    {
        xmax = x;
        return true;
    }
    return false;
}

template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {})
{
    if (comp(x, xmin))
    {
        xmin = x;
        return true;
    }
    return false;
}

// Union-Find
struct UnionFind
{
    // core member
    vector<int> par;

    // constructor
    UnionFind() {}
    UnionFind(int n) : par(n, -1) {}
    void init(int n) { par.assign(n, -1); }

    // core methods
    int root(int x)
    {
        if (par[x] < 0)
            return x;
        else
            return par[x] = root(par[x]);
    }

    bool same(int x, int y)
    {
        return root(x) == root(y);
    }

    bool unite(int x, int y)
    {
        x = root(x), y = root(y);
        if (x == y)
            return false;
        if (par[x] > par[y])
            swap(x, y); // merge technique
        par[x] += par[y];
        par[y] = x;
        return true;
    }

    int size(int x)
    {
        return -par[root(x)];
    }

    // グループ構造の詳細を取得する関数
    vector<vector<int>> groups()
    {
        // member[v] := 要素 v をリーダーとするグループ
        vector<vector<int>> member(par.size());
        for (int v = 0; v < (int)par.size(); ++v)
        {
            member[root(v)].push_back(v);
        }

        // 配列 member の空の部分を削除したものを作る
        vector<vector<int>> res;
        for (int v = 0; v < (int)par.size(); ++v)
        {
            if (!member[v].empty())
                res.push_back(member[v]);
        }
        return res;
    }
};

int main()
{
    int H, W;
    cin >> H >> W;
    vector<string> G(H);
    REP(i, H)
    {
        cin >> G[i];
    }

    UnionFind uf(H * W);
    int dx[4] = {1, 0, -1, 0};
    int dy[4] = {0, 1, 0, -1};

    REP(i, H)
    {
        REP(j, W)
        {
            REP(k, 4)
            {
                int nx = i + dx[k];
                int ny = j + dy[k];
                if (nx < 0 || nx >= H || ny < 0 || ny >= W)
                {
                    continue;
                }
                if (G[i][j] == G[nx][ny])
                    uf.unite(i * W + j, nx * W + ny);
            }
        }
    }
    set<int> S;
    for (auto g : uf.groups())
    {
        if (g.size() > 3)
        {
            S.insert(uf.root(g[0]));
        }
    }
    REP(i, H)
    {
        REP(j, W)
        {
            if (S.count(uf.root(i * W + j)))
            {
                G[i][j] = '.';
            }
        }
    }
    REP(i, H)
    {
        cout << G[i] << endl;
    }
}