#include<bits/stdc++.h>
#define reg register int
#define il inline
#define numb (ch^'0')
#define mid ((l+r)>>1)
#define ls (x<<1)
#define rs (x<<1|1)
#define fi first
#define se second
using namespace std;
typedef long long ll;
il void rd(int &x){char ch;x=0;bool fl=false;while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);for(x=numb;isdigit(ch=getchar());x=x*10+numb);(fl==true)&&(x=-x);
}
namespace Miracle{
const int N=4e6+10;
int n,m,q;
int *lmx[4*N],*rmx[4*N],*ans[4*N];
int Pool[14*N],*cur=Pool,*mp[N];
struct que{int l,r;pair<int,int>q[N];
//    void p_f(int L){
//        while(l<=r&&q[l]<L) ++l;
//    }void push(int id,int v){while(l<=r&&q[r].se>v) --r;q[++r]=make_pair(id,v);}int get(int L){while(l<=r&&q[l].fi<L) ++l;if(l<=r) return q[l].se;else return -1;}void clear(){l=1,r=0;}
}Q1,Q2;
void pushup(int x,int l,int r){Q1.clear();Q2.clear();int j=1;for(reg i=1;i<=m;++i){Q1.push(i,rmx[ls][i]);Q2.push(i,lmx[rs][i]);while(i>=j&&Q1.get(j)+Q2.get(j)<i-j+1){++j;}ans[x][i]=i-j+1;}for(reg i=1;i<=m;++i){ans[x][i]=max(ans[x][i],max(ans[ls][i],ans[rs][i]));lmx[x][i]=(lmx[ls][i]==mid-l+1)?lmx[ls][i]+lmx[rs][i]:lmx[ls][i];rmx[x][i]=(rmx[rs][i]==r-mid)?rmx[rs][i]+rmx[ls][i]:rmx[rs][i];}
}
void build(int x,int l,int r){lmx[x]=cur;cur+=m+1;rmx[x]=cur;cur+=m+1;ans[x]=cur;cur+=m+1;if(l==r){for(reg i=1;i<=m;++i){ans[x][i]=rmx[x][i]=lmx[x][i]=mp[l][i];}return;}build(x<<1,l,mid);build(x<<1|1,mid+1,r);pushup(x,l,r);
}
void upda(int x,int l,int r,int p,int t,int c){if(l==r){ans[x][t]=rmx[x][t]=lmx[x][t]=c;return;}if(p<=mid) upda(x<<1,l,mid,p,t,c);else upda(x<<1|1,mid+1,r,p,t,c);pushup(x,l,r);
}
int mx;
void merge(int x,int l,int r,int L,int R,int U,int D){Q1.clear();Q2.clear();int j=U;for(reg i=U;i<=D;++i){Q1.push(i,min(mid-L+1,rmx[ls][i]));Q2.push(i,min(R-mid,lmx[rs][i]));while(i>=j&&Q1.get(j)+Q2.get(j)<i-j+1){++j;}mx=max(mx,i-j+1);}
}
void query(int x,int l,int r,int L,int R,int U,int D){if(L<=l&&r<=R){for(reg i=U;i<=D;++i){mx=max(mx,min(ans[x][i],i-U+1));}return;}if(L<=mid&&mid<R) {query(x<<1,l,mid,L,R,U,D);query(x<<1|1,mid+1,r,L,R,U,D);merge(x,l,r,L,R,U,D);}else if(L<=mid){query(x<<1,l,mid,L,R,U,D);}else{query(x<<1|1,mid+1,r,L,R,U,D);}
}int main(){rd(n);rd(m);rd(q);Q1.clear();Q2.clear();for(reg i=1;i<=n;++i){mp[i]=cur;cur+=m+1;for(reg j=1;j<=m;++j){rd(mp[i][j]);}}build(1,1,n);int x,y,l,s,r,t;int op;while(q--){rd(op);if(op==0){rd(x);rd(y);mp[x][y]^=1;upda(1,1,n,x,y,mp[x][y]);}else{mx=0;rd(l);rd(s);rd(r);rd(t);query(1,1,n,l,r,s,t);printf("%d\n",mx);}}return 0;
}}
signed main(){Miracle::main();return 0;
}/*Author: *Miracle*Date: 2019/2/13 21:22:39
*/