#include<bits/stdc++.h>
using namespace std;const int N=2007,M=1;
int n,m,q,a[N][N],b[N][N],c[N][N],d[N],vis[N],bl[N],fr[N],ed[N],nx,ny;
char ch[9];
void calc(int x,int y){
	int x0=(x+n-2)%n+1,x1=x,x2=x%n+1,y0=y%m+1;
	if(a[x0][y0]>a[x1][y0])b[x][y]=(a[x0][y0]>a[x2][y0]?x0:x2);
	else b[x][y]=(a[x1][y0]>a[x2][y0]?x1:x2);
}
void upd_d(){
	for(int i=1;i<=n;++i){
		int p=i;for(int j=0;j<=bl[m];++j)p=c[j][p];d[i]=p;
	}
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)scanf("%d",&a[i][j]);
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)calc(i,j);
	for(int i=1;i<=m;++i)bl[i]=i/M;nx=ny=1;
	for(int i=0;i<=bl[m];++i)fr[i]=max(i*M,1),ed[i]=min(m,i*M+M-1);
	for(int i=0;i<=bl[m];++i){
		for(int j=1;j<=n;++j){
			int p=j;for(int k=fr[i];k<=ed[i];++k)p=b[p][k];
			c[i][j]=p;
		}
	}
	upd_d();
	scanf("%d",&q);while(q--){
		int x,y,z;scanf("%s%d",ch,&x);
		if(ch[0]=='m'){
			while(x&&ny!=m+1)nx=b[nx][ny],ny++,x--;if(ny>m)ny-=m;
			if(!x){printf("%d %d\n",nx,ny);continue;}
			int w=x/m,qt=0;for(int i=1;i<=n;++i)vis[i]=-1;vis[nx]=0;
			while(qt<w){
				nx=d[nx];++qt;
				if(vis[nx]>=0){w=(w-qt)%(qt-vis[nx]);qt=0;break;}
				vis[nx]=++qt;
			}
			while(qt<w)++qt,nx=d[nx];
			for(int i=1;i<=x%m;++i)nx=b[nx][ny],ny++;
			printf("%d %d\n",nx,ny);
		}
		else{
			scanf("%d%d",&y,&z);a[x][y]=z;
			int x0=(x+n-2)%n+1,x1=x,x2=x%n+1,y0=(y+m-2)%m+1;
			calc(x0,y0);calc(x1,y0);calc(x2,y0);y0=bl[y0];
			for(int i=1;i<=n;++i){
				int p=i;for(int j=fr[y0];j<=ed[y0];++j)p=b[p][j];
				c[y0][i]=p;
			}
			upd_d();
		}
	}
}