#include <bits/stdc++.h>
#define ll long long
#define N int(1e6)
using namespace std;
ll m, n, a[2010][2010], q, f[2010][2010];
ll kq(ll x1, ll x2, ll y1, ll y2)
{
    return f[x2][y2]-f[x1-1][y2]-f[x2][y1-1]+f[x1-1][y1-1];
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>m>>n;
    for(int i=1; i<=m; i++)
    {
        for(int j=1; j<=n; j++)
        {
            cin>>a[i][j];
            a[i+m][j]=a[i][j];
            a[i][j+n]=a[i][j];
            a[i+m][j+n]=a[i][j];
        }
    }
    for(int i=1; i<=2*m; i++)
        for(int j=1; j<=2*n; j++)
            f[i][j]=f[i-1][j]+f[i][j-1]+a[i][j]-f[i-1][j-1];
    cin>>q;
    ll l=0, r=0;
    while(q--)
    {
        int p;
        cin>>p;
        if(p==0)
        {
            int x, y;
            cin>>x>>y;
            l=(l+x);
            r=(r+y);
        }
        else
        {
            ll u, v, s, t;
            cin>>u>>v>>s>>t;
            u=(u+r);
            s=(s+r) ;
            ll len1=s-u;
            v=(v+l);
            t=(t+l) ;
            ll len2=t-v;
            u=(u-1)%m+1 ;
            s=u+len1;
            v=(v-1)%n+1;
            t=v+len2;

            cout<<kq(min(u, s), max(u, s), min(v, t), max(v, t))<<'\n';
        }
    }
    return 0;
}