#include<bits/stdc++.h>using namespace std;inline int read(){int ans=0;char last=' ',ch=getchar();while(ch<'0'||ch>'9') last=ch,ch=getchar();while(ch>='0'&&ch<='9') ans=ans*10+ch-'0',ch=getchar();if(last=='-') ans=-ans;return ans;
}int n,m,q,opt,l,r;
char s[100008][31];int cx(int l,int r){long long cnt1;int ans=1;int qj=r-l+1;for(int i=1;i<=n;i++){char d=' ';cnt1=0;for(int j=l;j<=r;j++){if(s[j][i]=='?'){cnt1++;continue;}if(d==' ') d=s[j][i];if(d==s[j][i]) continue;else return 0;}if(cnt1==qj) ans*=2;}return ans;
}int main(){n=read();m=read();q=read();if(m==1)return 0;for(int i=1;i<=m;i++)scanf("%s",s[i]+1);for(int i=1;i<=q;i++){opt=read();if(opt==0){l=read();r=read();cout<<cx(l,r)<<"\n";}else {char ss[31];int f=read();scanf("%s",ss+1);for(int i=1;i<=n;i++){s[f][i]=ss[i];}}}return 0;
} 

#include<bits/stdc++.h>using namespace std;inline int read(){int ans=0;char last=' ',ch=getchar();while(ch<'0'||ch>'9') last=ch,ch=getchar();while(ch>='0'&&ch<='9') ans=ans*10+ch-'0',ch=getchar();if(last=='-') ans=-ans;return ans;
}int n,m,q,opt,l,r;
char s[100008][31];int cx(int l,int r){int cnt1[31];memset(cnt1,0,sizeof(cnt1));if(l==r) {int cnt=1;for(int i=1;i<=n;i++)if(s[l][i]=='?') cnt*=2;return cnt;}int k=l;for(int i=1;i<=n;i++){char d='x';for(int j=l;j<=r;j++){if(s[j][i]=='?'){cnt1[i]++;continue;}if(d=='x') d=s[j][i];if(d==s[j][i]) continue;else return 0;}}int ans=1;int qj=r-l+1;for(int i=1;i<=n;i++){if(cnt1[i]==qj) ans*=2;else ans*=1;}return ans;
}int main(){freopen("lin.in","r",stdin);freopen("lin.out","w",stdout);n=read();m=read();q=read();if(m==1)return 0;for(int i=1;i<=m;i++)scanf("%s",s[i]+1);for(int i=1;i<=q;i++){opt=read();if(opt==0){l=read();r=read();cout<<cx(l,r)<<"\n";}else {char ss[31];int f=read();scanf("%s",ss+1);for(int i=1;i<=n;i++){s[f][i]=ss[i];}}}return 0;
} 

#include <cstdio>template <typename T>
inline void qr(T &x) {char ch = getchar(), lst = ' ';while ((ch > '9') || (ch < '0')) lst = ch, ch=getchar();while ((ch >= '0') && (ch <= '9')) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();if (lst == '-') x = -x;
}const int maxn = 100010;int n, m, q;
char s[maxn][35];#ifdef ONLINE_JUDGE
int Ans;
#endifstruct Tree {Tree *ls, *rs;int l, r, x/*int1*/, y/*int2*/;bool leg;//判断
Tree() {ls = rs = NULL;l = r = x = y = 0;leg = true;}void pushup() {if (!(this->ls->leg && this->rs->leg)) {//左右子树都不合法 this->leg = false;} else {if ((this->ls->x & this->rs->x) & (this->ls->y ^ this->rs->y)) {//只有当左右儿子对应位置是否全为1或0都相同并且左右儿子对应的y不相同时，显然不合法 this->leg = false;} else {this->leg = true;this->x = this->ls->x | this->rs->x;this->y = this->ls->y | this->rs->y;}}}
};
Tree *rot;void ReadStr(char *p);
void Update(const int x);
void Query(const int l, const int r);
void update(Tree *const u, const int p);
Tree query(Tree *u, const int l, const int r);
void build(Tree *const u, const int l, const int r);int main() {freopen("lin.in", "r", stdin);freopen("lin.out", "w", stdout);qr(n); qr(m); qr(q);for (int i = 1; i <= m; ++i) {ReadStr(s[i] + 1);//读入一串字符串的神仙操作
  }build(rot = new Tree, 1, m);int opt, l, r;while (q--) {opt = 0; qr(opt);if (opt == 0) {l = r = 0; qr(l); qr(r);Query(l, r);} else {l = 0; qr(l);ReadStr(s[0] + 1);Update(l);}}
#ifdef ONLINE_JUDGEprintf("%d\n", Ans);
#endifreturn 0;
}void ReadStr(char *p) {do *p = getchar(); while ((*p != '0') && (*p != '1') && (*p != '?'));do *(++p) = getchar(); while ((*p == '0') || (*p == '1') || (*p == '?'));*p = 0;
}void build(Tree *const u, const int l, const int r) {if ((u->l = l) == (u->r = r)) {//叶节点 for (int i = 1; i <= n; ++i) {//直接扫描记录即可 if (s[l][i] != '?') {u->x |= 1 << i;if (s[l][i] == '1') {u->y |= 1 << i;}}}} else {//不是叶节点，递归建树； int mid = (l + r) >> 1;build(u->ls = new Tree, l, mid);build(u->rs = new Tree, mid + 1, r);u->pushup();}
}Tree query(Tree *u, const int l, const int r) {if ((u->l > r) || (u->r < l)) return Tree();if ((u->l >= l) && (u->r <= r)) return *u;Tree _ret;auto ll = query(u->ls, l, r), rr = query(u->rs, l, r);_ret.ls = &ll; _ret.rs = &rr;_ret.pushup();return _ret;
}void Query(const int l, const int r) {auto _ret = query(rot, l, r);if (!_ret.leg) {
#ifndef ONLINE_JUDGEputs("0");
#endif} else {int ans = 1;for (int i = 1; i <= n; ++i) if (!(_ret.x & (1 << i))) {ans <<= 1;}
#ifdef ONLINE_JUDGEAns ^= ans;
#elseprintf("%d\n", ans);
#endif}
}void update(Tree *u, const int p) {if (u->ls) {if (u->ls->r >= p) {update(u->ls, p);} else {update(u->rs, p);}u->pushup();} else {*u = Tree();u->l = u->r = p;for (int i = 1; i <= n; ++i) {if (s[0][i] != '?') {u->x |= 1 << i;if (s[0][i] == '1') {u->y |= 1 << i;}}}}
}void Update(const int x) {update(rot, x);
}