#include<bits/stdc++.h>
using namespace std;
int n,m,q,e[2050][2050],nxt[2050][2050],skp[2050],x,y,z,curx,cury;
string op;
int ansx,ansy;
void upd(int i,int j) {
    if ((e[i][(j+1)%m]>=e[(i+n-1)%n][(j+1)%m])&&(e[i][(j+1)%m]>=e[(i+1)%n][(j+1)%m])) nxt[i][j]=i;
    else if (e[(i+n-1)%n][(j+1)%m]>e[(i+1)%n][(j+1)%m]) nxt[i][j]=(i+n-1)%n;
    else nxt[i][j]=(i+1)%n;
}
void do_walk(int &ansx,int &ansy) {
    ansx=nxt[ansx][ansy];
    ansy=(ansy+1)%m;
}
void do_skip(int &ansx,int &ansy) {
    ansx=skp[ansx];
}
int vis[2050];
void solve(int &ansx,int &ansy,int cnt) {
    memset(vis,0,sizeof(vis));
    int cur=1;
    vis[ansx]=cur;
    while (cnt) {
        cnt--;
        do_skip(ansx,ansy);
        cur++;
        if (vis[ansx]) {
            cnt%=(cur-vis[ansx]);
            break;
        } else {
            vis[ansx]=cur;
        }
    }
    while (cnt) {
        cnt--;
        do_skip(ansx,ansy);
    }
}
void refresh(int x,int y) {
    upd(x,y);
    int curx=x;cury=y;
    do_walk(curx,cury);
    while (cury) do_walk(curx,cury);
    int ll=x+n*m,rr=x+n*m;
    for (int i=(y-1)%m;i>=0;i--) {
        if (nxt[(ll-1)%n][i]==ll%n) ll--;
        else if (nxt[ll%n][i]==(ll-1)%n) ll++;
        if (nxt[(rr+1)%n][i]==rr%n) rr++;
        else if (nxt[rr%n][i]==(rr+1)%n) rr--;
        if (rr-ll+1>=n) break;
        if (ll>rr) break;
    }
    for (int i=ll;i<=rr;i++) skp[i%n]=curx;
}
int main() {
    scanf("%d%d",&n,&m);
    for (int i=0;i<n;i++) {
        for (int j=0;j<m;j++) scanf("%d",&e[i][j]);
    }
    for (int i=0;i<n;i++) {
        for (int j=0;j<m;j++) {
            upd(i,j);
        }
    }
    for (int i=0;i<n;i++) {
        skp[i]=i;
        for (int j=0;j<m;j++) skp[i]=nxt[skp[i]][j];
    }
    cin>>q;
    while (q--) {
        cin>>op;
        if (op=="move") {
            cin>>x;
            while (ansy&&x) {
                x--;
                do_walk(ansx,ansy);
            }
            if (!x) {
                cout<<ansx+1<<' '<<ansy+1<<endl;
                continue;
            } else {
                y=x/m;x%=m;
                solve(ansx,ansy,y);
                while (x) {
                    x--;
                    do_walk(ansx,ansy);
                }
                cout<<ansx+1<<' '<<ansy+1<<endl;
            }
        } else {
            cin>>x>>y>>z;
            x--;y--;
            e[x][y]=z;
            refresh((x+n-1)%n,(y+m-1)%m);
            refresh(x,(y+m-1)%m);
            refresh((x+1)%n,(y+m-1)%m);
        }
    }
    return 0;
}