#include <bits/stdc++.h>
                        #include<iostream>
                        #include<cstdio>
                        #include<vector>
                        #include<queue>
         
                        #include<map>
                        #include<cstring>
                        #include<string>
                        #include <math.h>
                        #include<algorithm>
                        #include<functional>
            //       #define int long long
                        #define inf  1000000007
                        #define pa pair<int,int>
        //        #define ll long long
                        #define pal pair<ll,ll>
                        #define ppa pair<pa,pa>
                        #define mp make_pair
                        #define EPS (1e-10)
                        #define equals(a,b) (fabs((a)-(b))<EPS)
                 
                        using namespace std;
                 
                        class Point{
                        	public:
                        	double x,y;
                        	Point(double x=0,double y=0):x(x),y(y) {}
                        	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                        	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                        	Point operator * (double a) {return Point(x*a,y*a);}
                        	Point operator / (double a) {return Point(x/a,y/a);}
                        	double absv() {return sqrt(norm());}
                        	double norm() {return x*x+y*y;}
                        	bool operator < (const Point &p) const{
                        		return x != p.x ? x<p.x: y<p.y;
                        	}
                        	bool operator == (const Point &p) const{
                        		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                        	}
                        };
                        typedef Point Vector;
                 
                        struct Segment{
                        Point p1,p2;
                        };
                 
                    double hen(Vector a){
                    if(fabs(a.x)<EPS && a.y>0) return acos(0);
                    else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
                    else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
                    else if(fabs(a.y)<EPS && a.x>0) return 0.0;
                    else if(a.y>0) return acos(a.x/a.absv());
                    else return 2*acos(0)+acos(-a.x/a.absv());
                 
                    }
                 
                        double dot(Vector a,Vector b){
                        	return a.x*b.x+a.y*b.y;
                        }
                        double cross(Vector a,Vector b){
                        	return a.x*b.y-a.y*b.x;
                        }
                        int dx[4] = {1, 0, -1, 0};
                        int dy[4] = {0, 1, 0, -1};
        
                        //----------------kokomade temple------------
int z[600][600]={0};
int zz[600][600]={0};
int zzz[600][600]={0};
      signed main(){
      	int h;
      	int w;
      cin>>h>>w;
      	for(int i=0;i<h;i++){
      		string s;
      		cin>>s;
      		for(int j=0;j<w;j++){
      			if(s[j]=='#') z[i][j]=1;
      		}		
      	}  		
		
      	for(int i=0;i<h;i++){
      		if(i%2==1)zz[i][0]=1;
      		else{
      		for(int j=0;j<w-1;j++){
      			zz[i][j]=1;
      		}
      		}
      	}
      	
      	for(int i=0;i<h;i++){
      		if(i%2==0)zzz[i][w-1]=1;
      		else{
      		for(int j=1;j<w;j++){
      			zzz[i][j]=1;
      		}
      		}
      	}
      	
      	
      	
      	for(int i=0;i<h;i++){
      		for(int j=0;j<w;j++){
      			if(zz[i][j]+z[i][j]>0) cout<<"#";
      			else cout<<".";
      		}
      		cout<<endl;
      	}		
      	cout<<endl;
      	
      	for(int i=0;i<h;i++){
      		for(int j=0;j<w;j++){
      			if(zzz[i][j]+z[i][j]>0) cout<<"#";
      			else cout<<".";
      		}
      		cout<<endl;
      	}	
return 0;
      }

Measured memory_bytes: 4352