#include "bits/stdc++.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif


const int MOD = 1000000007;
const char nl = '\n';
const int MX = 310; 

int cur[MX][MX], nxt[MX][MX];

void solve() {
    int N, M; cin >> N >> M;
    FOR(i, 5, M+5) {
        FOR(j, 5, N+5) {
            char C; cin >> C;
            if (C == '#') {
                cur[i][j] = 1;
            }
        }
    }

    while (true) {
        int bi = -1, bj3 = -1;
        F0R(i, MX) {
            int cnt[3]; F0R(j, 3) cnt[j] = 0;
            F0R(j, MX) {
                cnt[j%3] ^= cur[i][j];
            }
            if (cnt[0] == cnt[1] && cnt[0] == cnt[2]) continue;
            if (bi != -1) {
                goto done;
            }
            bi = i;
            F0R(j, 3) {
                if (cnt[j] != cnt[(j+1)%3] && cnt[j] != cnt[(j+2)%3]) {
                    bj3 = j;
                }
            }
        }

        int bj = -1, bi3 = -1;
        F0R(i, MX) {
            int cnt[3]; F0R(j, 3) cnt[j] = 0;
            F0R(j, MX) {
                cnt[j%3] ^= cur[j][i];
            }
            if (cnt[0] == cnt[1] && cnt[0] == cnt[2]) continue;
            if (bj != -1) {
                goto done;
            }
            bj = i;
            F0R(j, 3) {
                if (cnt[j] != cnt[(j+1)%3] && cnt[j] != cnt[(j+2)%3]) {
                    bi3 = j;
                }
            }
        }
        //dbg(bi, bj, bi3, bj3);

        if (bi != -1 || bj != -1) {
            if (bi == -1 || bj == -1) goto done;
            if (bi % 3 != bi3 || bj % 3 != bj3) goto done;
            cur[bi][bj] ^= 1;
        }
        int cnt = 0;
        F0R(i, MX) F0R(j, MX) nxt[i][j] = 0;
        FOR(i, 2, MX) {
            FOR(j, 2, MX) {
                nxt[i][j] = cur[i-1][j-1];
                F0R(a, 3) {
                    F0R(b, 3) {
                        if (a != 0 || b != 0) {
                            nxt[i][j] ^= nxt[i-a][j-b];
                        }
                    }
                }
                cnt += nxt[i][j];
            }
        }

        if (cnt == 0) {
            if (bi != -1) {
                cur[bi][bj] ^= -1;
            }
            goto done;
        }
        F0R(i, MX) F0R(j, MX) cur[i][j] = nxt[i][j];
    }

    done:
    ;
    int lx = MX, hx = -1, ly = MX, hy = -1;
    F0R(i, MX) {
        F0R(j, MX) {
            if (cur[i][j]) {
                ckmin(lx, i); ckmax(hx, i);
                ckmin(ly, j); ckmax(hy, j);
            }
        }
    }
    //dbg(lx, hx, ly, hy);
    FOR(i, lx, hx+1) {
        FOR(j, ly, hy+1) {
            cout << (cur[i][j]?'#':'.');
        }
        cout << nl;
    }

}
 
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    int T = 1;
//    cin >> T;
    while(T--) {
        solve();
    }

	return 0;
}