#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <bitset>
#include <tuple>
#include <cmath>
#include <complex>
#include <algorithm>
#include <utility>
#include <regex>
#include <cstdint>
#include <numeric>
#include <functional>
#include <cassert>

using namespace std;
using ll = long long;
using ull = unsigned long long;

constexpr ll INF = 1'000'000'000'000'000'000;
namespace utils{
#define ALL(x) begin(x), end(x)
#define rALL(x) rbegin(x), rend(x)
    template<class T, class Compare> using p_queue = priority_queue<T, vector<T>, Compare>;
    template<class T> using min_queue = p_queue<T, greater<T>>;
    template<class T> using max_queue = p_queue<T, less<T>>;

    template<class T> bool min_update(T& X, const T& A){ if(X > A) {X = A; return true;} return false; }
    template<class T> bool max_update(T& X, const T& A){ if(X < A) {X = A; return true;} return false; }
    using V_Set = unordered_set<int>;
    using E_Set = unordered_map<int, V_Set>;

    ll operator"" _64(unsigned long long x){ return ll(x); }
    ull operator"" _64u(unsigned long long x){ return ull(x); }

    template<class T>
    vector<T> make_mdvector(int n, T t){
        return vector<T>(n, t);
    }
    template<class ...Ts>
    auto make_mdvector(int n, Ts ... ts){
        return vector<decltype(make_mdvector(ts...))>(n, make_mdvector(ts...));
    }

    template<class T>
    istream& operator>>(istream& is, vector<T>& v){
        for (auto &&x : v) { is >> x; } return is;
    }

    template<class T>
    ostream& operator<<(ostream& os, const vector<T>& v){
        for (auto &&x : v) { os << x << ' '; } cout << endl; return os ;
    }
}
using namespace utils;

constexpr array<int, 4> dx = {0, 1, 0, -1};
constexpr array<int, 4> dy = {1, 0, -1, 0};
class UFF {
    using Int = int;
    std::vector<Int> parent;
    std::vector<Int> rank;

public:
    explicit UFF(Int n) : parent(n, -1), rank(n, 0) {}

    Int find(Int x) {
        auto &px = parent[x];
        if (px < 0) {
            return x;
        } else {
            return px = find(px);
        }
    }

    bool unite(Int a, Int b) {
        const auto pa = find(a);
        const auto pb = find(b);
        if (pa == pb) return false;

        if (rank[pa] > rank[pb]) {
            parent[pa] += parent[pb];
            parent[pb] = pa;
        } else {
            parent[pb] += parent[pa];
            parent[pa] = pb;

            if (rank[pa] == rank[pb]) {
                rank[pb]++;
            }
        }
        return true;
    };

    Int size(Int x) {
        const auto px = find(x);
        return -parent[px];
    }

    bool is_same(Int a, Int b) {
        const auto pa = find(a);
        const auto pb = find(b);
        return pa == pb;
    }

    vector<Int> get_all_dset() {
        unordered_set<Int> dset;
        for (Int i = 0; i < parent.size(); ++i) {
            dset.insert(find(i));
        } // end i
        vector<Int> v(dset.size());
        Int i = 0;
        for (auto &&d : dset) {
            v[i++] = d;
        } // end d
//        sort(v.begin(), v.end());
        return v;
    }
};


class solver{
    istream& is;
    ostream& os;

public:
    solver(istream& I, ostream& O) :is(I), os(O) {}
    ll H, W;
    void run();
    vector<vector<char>> pur;
    vector<vector<int>> vis;
    int C = 0;
    vector<set<pair<int, int>>> vset;

    bool isout(int x, int y){
        return x < 0 or H <= x or y < 0 or W <= y;
    }
};


int main(int argc, char *argv[]) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(16) << scientific;
#ifdef DEBUG
    string test_cases = "test_C.txt";
    cerr << test_cases << " -->" << endl;
    auto fs = fstream(test_cases, fstream::in);
    int loop = 0;
    while(fs) {
        loop++;
        cout << '#' << loop << "#------\n";
        solver(fs, cout).run();
    }
    if(loop <= 1) {
        cout << "===" << endl;
        while(cin) solver(cin, cout).run();
    }
#else
    solver(cin, cout).run();
#endif
    return 0;
}

void solver::run(){
    is >> H >> W;
    if(!is) return;
    pur = make_mdvector(H, W, '.');
    is >> pur;
    vis = make_mdvector(H, W, 0);
    auto red = pur;
    for (int j = 0; j < W; ++j) {
        red[0][j] = '#';
    } // end j
    for (int i = 1; i < H-1; ++i) {
        for (int j = 0; j < W; j += 2) {
            red[i][j] = '#';
        } // end j
    } // end i
    auto blue = pur;
    for (int j = 0; j < W; ++j) {
        blue[H-1][j] = '#';
    } // end j
    for (int i = 1; i < H-1; ++i) {
        for (int j = 1; j < W; j += 2) {
            blue[i][j] = '#';
        } // end j
    } // end i
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            os << red[i][j];
        } // end j
        os << '\n';
    }
    os << '\n';
    for (int i = 0; i < H; ++i) {
        for (int j = 0; j < W; ++j) {
            os << blue[i][j];
        } // end j
        os << '\n';
    } // end i


}


Measured memory_bytes: 2560