//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 505
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n, m;
int a[N][N];
int pref[N][N];

int get(int l, int r, int x, int y){
    return pref[x][y] - pref[x][r-1] - pref[l-1][y] + pref[l-1][r-1];
}

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n >> m;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            cin >> a[i][j];
            pref[i][j] += pref[i-1][j] + pref[i][j-1];
            pref[i][j] -= pref[i-1][j-1];
            pref[i][j] += a[i][j];
        }
    }
}

int mov_row=0;
int mov_col=0;

int solve(int l, int r, int x, int y){
    l += mov_row; l%=n; if (l==0) l=n;
    x += mov_row; x%=n; if (x==0) x=n;
    r += mov_col; r%=m; if (r==0) r=m;
    y += mov_col; y%=m; if (y==0) y=m;
    //cout << l << ' ' << r << endl;
    //cout << x << ' ' << y << endl;
    if (x >= l && y >= r){
        return get(l,r,x,y);
    }
    if (x < l && y < r){
        int res=0;
        res += get(1,1,x,y);
        res += get(1,r,x,m);
        res += get(l,1,n,y);
        res += get(l,r,n,m);
        return res;
    }
    if (x < l && y >= r){
        int res=0;
        res += get(1,r,x,y);
        res += get(l,r,n,y);
        return res;
    }
    if (x >= l && y < r){
        int res = 0;
        res += get(l,1,x,y);
        res += get(l,r,x,m);
        return res;
    }
}

void proc()
{
    int q;
    cin >> q;
    //cout << get(3,4,4,4)<< endl;
    while (q--){
        int p; cin >> p;
        if (p==0){
            int R, D;
            cin >> R >> D;
            mov_row += D; mov_row %= n;
            mov_col += R; mov_col %= m;
        }
        else{
            int l, r, x, y;
            cin >> l >> r >> x >> y;
            cout << solve(l,r,x,y) << '\n';
        }
    }
}

signed main()
{
    readfile();
    proc();
    return 0;
}