/*
Author: QAQAutomaton
Lang: C++
Code: F.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int inf;
const double eps=1e-8;
const double pi=acos(-1.0);
template<class T>int chkmin(T &a,T b){return a>b?a=b,1:0;}
template<class T>int chkmax(T &a,T b){return a<b?a=b,1:0;}
template<class T>T sqr(T a){return a*a;}
template<class T>T mmin(T a,T b){return a<b?a:b;}
template<class T>T mmax(T a,T b){return a>b?a:b;}
template<class T>T aabs(T a){return a<0?-a:a;}
template<class T>int dcmp(T a,T b){return a>b;}
template<int *a>int cmp_a(int x,int y){return a[x]<a[y];}
#define min mmin
#define max mmax
#define abs aabs
struct __INIT__{
	__INIT__(){
		memset(&inf,0x3f,sizeof(inf));
	}
}__INIT___;
namespace io {
	const int SIZE = (1 << 21) + 1;
	char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
	// getchar
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	// print the remaining part
	inline void flush () {
		fwrite (obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	// putchar
	inline void putc (char x) {
		*oS ++ = x;
		if (oS == oT) flush ();
	}
	template<typename A>
	inline bool read (A &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}
	inline bool read (char &x) {
		while((x=gc())==' '||x=='\n' || x=='\r');
		return x!=EOF;
	}
	inline bool read(char *x){
		while((*x=gc())=='\n' || *x==' '||*x=='\r');
		if(*x==EOF)return 0;
		while(!(*x=='\n'||*x==' '||*x=='\r'))*(++x)=gc();
		*x=0;
		return 1;
	}
	template<typename A,typename ...B>
	inline bool read(A &x,B &...y){
		return read(x)&&read(y...);
	}
	template<typename A>
	inline bool write (A x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}
	inline bool write (char x) {
		putc(x);
		return 0;
	}
	inline bool write(const char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	inline bool write(char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	template<typename A,typename ...B>
	inline bool write(A x,B ...y){
		return write(x)||write(y...);
	}
	//no need to call flush at the end manually!
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: read;
using io :: putc;
using io :: write;
char s[1000005];
bitset<2000005> a,b;
int hv1[2000005],t;
bitset<2000005>is,w,p;
int at[2000005],nex[2000005],las[2000005],rs[2000005],lss[2000005],cnt[2000005];
int td[2000005],ta[2000005];
int dt,act;
void add(int x){
	int ox=x;
	if(a[x]){
		b[x]=1;
		a[x]=0;
		for(++x;;++x){
			if(a[x]){a[x]=0;is[x]=1;}
			else{a[x]=1;if(b[x])is[x]=1;else is[x]=0;break;}
		}
	}
	else{
		a[x]=1;
		b[x]=0;
		for(++x;;++x){
			if(b[x]){b[x]=0;is[x]=1;}
			else{b[x]=1;if(a[x])is[x]=1;else is[x]=0;break;}
		}
	}
	if(!is[x]){
		if(x!=rs[x]){
			at[x+1]=nex[at[x]];lss[rs[x]]=x+1;
			a[x+1]=b[x+1]=w[nex[at[x]]];
			nex[at[x]]=las[nex[at[x]]]=0;
			rs[x]=x;
		}
		--x;
	}
	for(;x>ox;--x){
		w[at[x]]=a[x];
		if(is[x+1]){rs[x]=rs[x+1];nex[at[x]]=at[x+1];las[at[x+1]]=at[x];}
		else{
			rs[x]=x;
			las[at[x]]=nex[at[x]]=0;
		}
		lss[rs[x]]=x;
		if((cnt[rs[x]]+=a[x])==1 && a[x]){
			hv1[++t]=rs[x];
		}
	}
}


signed main(){
#ifdef QAQAutoMaton 
	freopen("F.in","r",stdin);
	freopen("F.out","w",stdout);
#endif
	int n,m,k;
	read(n,m,k);
	read(s);
	reverse(s,s+n);
	for(int i=0;i<n;++i)a[i]=s[i]=='1';
	read(s);
	reverse(s,s+m);
	for(int i=0;i<m;++i)b[i]=s[i]=='1';
	int mx=max(n+k-1,m+k-1);
	for(int i=mx;~i;--i){
		at[i]=i;
		if(a[i]==b[i]){
			w[i]=a[i];
			is[i]=1;		
			if(is[i+1]){rs[i]=rs[i+1];nex[i]=i+1;las[i+1]=i;}
			else{
				rs[i]=i;
			}
			lss[rs[i]]=i;
			cnt[rs[i]]+=a[i];
		}
	}
	for(int i=mx;~i;--i){
		if(rs[i]==i && cnt[i])hv1[++t]=i;
	}
	for(;k;--k){
		sort(hv1+1,hv1+t+1);
		for(int id=t;id;--id){
			int i=hv1[id];
			if(w[at[i]] && !(cnt[i]-=w[at[i]])){
				swap(hv1[id],hv1[t]);
				--t;
			}	
			if(w[at[i]])add(i+1);
			a[lss[i]]=b[lss[i]]=0;
			w[at[i]]=0;
			if(i!=lss[i]){
				int x=at[i],z=las[x];
				las[x]=nex[z]=0;
				int y=lss[i];
				las[nex[x]=at[y]]=x;
				at[i]=z;		
				at[y]=x;
			}
		}
	}
	for(int id=1;id<=t;++id){
		int i=hv1[id];
		for(int j=i,x=at[i];is[j];--j,x=las[x]){
			p[j]=w[x];
		}
	}
	for(int i=mx;~i;--i){
		a[i]=is[i]?p[i]:a[i];	
		b[i]=is[i]?p[i]:b[i];	
	}
	for(int i=mx,ok=0;~i;--i){
		if(a[i]||i==0)ok=1;
		if(ok)putc(a[i]+'0');
	}
	putc('\n');

	for(int i=mx,ok=0;~i;--i){
		if(b[i]||i==0)ok=1;
		if(ok)putc(b[i]+'0');
	}
	putc('\n');
	return 0;
}


Measured memory_bytes: 58112