#include<iostream>
#include<cstdio>
#include<bitset>
#include<algorithm>
#define N 2000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct reads
{
	int l,r;
	bitset<N+1>d;
	bool operator < (const reads &t)const
	{
		return l<t.l;
	}
};
reads st[10*N+1];
bitset<N+1>B[N+1];
bitset<N+1>a[N+1];
bitset<N+1>b[N+1];
bitset<N+1>c[N+1];
bitset<N+1>tmp;
bitset<N+1>zero;
bitset<N+1>delta[N+1];
int n,m,q,op[N+1],ps[N+1],sr[N+1],length;
bitset<N+1>get()
{
	char c;
	for (int i=1;i<=m;++i) cin>>c,tmp[i]=c-'0';
	return tmp;
}
void output(bitset<N+1>d)
{
	for (int i=1;i<=m;++i) printf("%d",(int)(d[i]));
	puts("");
	return;
}
void change(int x,int t,bitset<N+1>d)
{
	st[++length]=(reads){ps[x],t-1,a[x]},a[x]=d,ps[x]=t;
	return;
}
void Insert(bitset<N+1>d,int t)
{
	for (int i=1;i<=m;++i)
		if (d[i])
		{
			if (!c[i][i])
			{
				c[i]=d,sr[i]=t;
				return;
			}
			else
			{
				if (sr[i]<t) swap(c[i],d),swap(sr[i],t);
				d^=c[i];
			}
		}
	return;
}
bitset<N+1>query(int t)
{
	bitset<N+1>res;
	for (int i=1;i<=m;++i)
		if (!res[i]&&sr[i]>=t&&c[i][i])
			res^=c[i];
	return res;
}
int main()
{
	int l,r,pst=0;
	bitset<N+1>d;
	n=read(),m=read(),q=read();
	for (int i=1;i<=n;++i) a[i]=get();
	for (int i=n;i>=1;--i) a[i]^=a[i-1];
	for (int i=1;i<=n;++i) ps[i]=0;
	for (int i=1;i<=q;++i)
	{
		op[i]=read();
		if (op[i]==1)
		{
			l=read(),r=read(),d=get(),change(l,i,a[l]^d);
			if (r+1<=n) change(r+1,i,a[r+1]^d);
		}
		else if (op[i]==2)
		{
			for (int j=1;j<=n;++j) b[j]=b[j-1]^a[j];
			l=read(),r=read(),d=get(),change(l,i,d^b[l-1]);
			for (int j=l+1;j<=r;++j)
				if (a[j].any())
					change(j,i,zero);
			if (r+1<=n) change(r+1,i,b[r+1]^d);
		}
	}
	for (int i=1;i<=n;++i) st[++length]=(reads){ps[i],q,a[i]};
	sort(st+1,st+length+1);
	for (int i=1;i<=q;++i)
	{
		while (pst+1<=length&&st[pst+1].l<=i) ++pst,Insert(st[pst].d,st[pst].r);
		if (op[i]==3) output(query(i));
	}
	return 0;
}