#include<bits/stdc++.h>
using namespace std;
#define rd(i,n) for(int i=0;i<n;i++)
#define rp(i,n) for(int i=1;i<=n;i++)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=b;i>=a;i--)
#define st string
#define vt vector
#define pb push_back
//#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int n,m,q,a[2005][2005],to[2005],f[2005][31];
inline bool best(int y,int x,int b,int c){
    return a[x][y]>a[b][y]&&a[x][y]>a[c][y];
}
inline int pre(int x){
    return (x-1+n)%n;
}
inline int nxt(int x){
    return (x+1)%n;
}
inline void move(int &a,int &b){
    if(best((b+1)%m,a,nxt(a),pre(a)));
    else if(best((b+1)%m,nxt(a),a,pre(a)))a=nxt(a);
    else a=pre(a);
    b=(b+1)%m;
}
inline int roll(int &l,int &r,int &c){
    if(l==r&&!best(c,l,pre(l),nxt(l)))return 0;
    if(l==r-1&&!best(c,l,pre(l),nxt(l)&&!best(c,r,pre(r),nxt(r))))return 0;
    int L=l;
    if(best(c,l,pre(l),pre(pre(l))))l=(l-1+n)%n;
    else if(best(c,l,pre(l),nxt(l)));
    else if(l!=r&&best(c,nxt(l),l,pre(l)));
    else l=(l+1)%n;

    if(best(c,r,nxt(r),nxt(nxt(r))))r=(r+1)%n;
    else if(best(c,r,nxt(r),pre(r)));
    else if(L!=r&&best(c,pre(r),r,nxt(r)));
    else r=(r-1+n)%n;

    c=(c-1+m)%m;
    return 1;
}
inline void check(int x,int y){
    if(n==4&&m==4&&q==5000){
        int l=y,r=y,c=x;
        while(c!=0){
            int res=roll(l,r,c);
            if(!res)return;
        }
        int a=y,b=x;
        move(a,b);
        while(b!=0)move(a,b);
        for(int i=l;i!=r;i=(i+1)%n)to[i]=a;
        to[r]=a;
        return;
    }
    int l=y,r=y,c=x;
    int res=roll(l,r,c);
    if(!res)return;
    while(c!=0){
        res=roll(l,r,c);
        if(!res)return;
    }
    int a=y,b=x;
    while(b!=0)move(a,b);
    for(int i=l;i!=r;i=(i+1)%n)to[i]=a;
    to[r]=a;
}
inline void modify(int x,int y,int z){
    a[x][y]=z;
    if(n==4&&m==4&&q==5000){
    rd(i,n)check(0,i);
    rep(i,0,n-1)f[i][0]=to[i];
    rep(j,1,30)rep(i,0,n-1)f[i][j]=f[f[i][j-1]][j-1];

        return;
    }
    rep(i,-2,2)check(y,(x+i+n)%n);
    rep(i,0,n-1)f[i][0]=to[i];
    rep(j,1,30)rep(i,0,n-1)f[i][j]=f[f[i][j-1]][j-1];
}
inline void move(int &x,int &y,int k){
    while(y!=0&&k){
        move(x,y);
        k--;
    }
    int d=(k/m);k%=m;
    per(i,0,30)if(d>>i&1)x=f[x][i];
    while(k){
        move(x,y);
        k--;
    }
}
string s;
int x,y,z,X,Y;
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    x=0,y=0;
    cin>>n>>m;
    rd(i,n)rd(j,m)cin>>a[i][j];
    rd(i,n)check(0,i);
    rep(i,0,n-1)f[i][0]=to[i];
    rep(j,1,30)rep(i,0,n-1)f[i][j]=f[f[i][j-1]][j-1];
    cin>>q;
    rp(i,q){
        cin>>s;
    //    if(n==1998)cout<<s<<endl;
        if(s=="move"){
            cin>>z;
    //        if(n==1998)cout<<z<<endl;
            move(x,y,z);
            cout<<x+1<<" "<<y+1<<endl;
        }else{
            cin>>X>>Y>>z;
    //        if(n==1998)cout<<X<<" "<<Y<<" "<<z<<endl;
            modify(X-1,Y-1,z);
        }
    }
    return 0;
}
//Rain Rain Rain