#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;

int read() {
    int x=0,w=1; char c=getchar(); 
    while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
    while(isdigit(c)) {x=x*10+c-'0'; c=getchar();}
    return x*w;
}

const int N=2009;
typedef bitset<N> bset;
int n,m,q,s[N],t[N],tot,id[N];
bset a[N],b[N],p[N];

void bread(bset &res) {
    static char c[2009]; scanf("%s",c);
    rep(i,0,m-1) if(c[i]=='1') res.set(m-1-i);
}
void elim(int k) {
    per(i,m-1,0) if(b[k][i]) {
        if(s[i]) b[k]^=b[s[i]], p[k]^=p[s[i]];
        else {s[i]=k, t[k]=i; break;}
    }
}
void mdf(int i,bset w) {
    int j=0; tot=0;
    rep(k,1,n) if(p[k][i]) {
        if((!j)||t[k]<t[j]) j=k;
        id[++tot]=k;
    }
    rep(k,1,tot) if(id[k]!=j) b[id[k]]^=b[j], p[id[k]]^=p[j];
    b[j]^=w; if(~t[j]) s[t[j]]=0; t[j]=-1; elim(j);
}
bset qry() {
    bset res;
    per(i,m-1,0) if(!res[i]&&s[i]) res^=b[s[i]];
    return res;
}

signed main() {
    n=read(), m=read(), q=read();
    rep(i,1,n) bread(a[i]), b[i]=a[i-1]^a[i], p[i].set(i), t[i]=-1;
    rep(i,1,n) elim(i);
    rep(i,1,q) {
        int op=read(),x,y; bset w;
        if(op==1) {
            x=read(), y=read(); bread(w);
            mdf(x,w); if(y!=n) mdf(y+1,w);
            rep(i,x,y) a[i]^=w;
        } else if(op==2) {
            x=read(), y=read(); bread(w);
            rep(i,x+1,y) if(a[i]!=a[i-1]) mdf(i,a[i]^a[i-1]);
            mdf(x,w^a[x]); if(y!=n) mdf(y+1,w^a[y]);
            rep(i,x,y) a[i]=w;
        } else {
            bset ans=qry();
            per(i,m-1,0) putchar('0'+ans[i]);
            putchar('\n');
        }
    }
    return 0;
}