#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
#define int long long
using namespace std;
typedef vector<int> vi;
const int MX=200020;

int T, N, K, Q;
int fa[MX], bel[MX], col[MX], num[MX], now[MX], ans[MX];
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
int find(int x){return x==fa[x]?fa[x]:fa[x]=find(fa[x]);}
void merge(int x, int y)
{
    x=find(x); y=find(y);
    if(x==y) return;
    if(x>y) swap(x,y);
    fa[y]=x;
}
struct node
{
    int u, rk;
    bool operator < (const node &a)const{
        return rk<a.rk;
    }
};
priority_queue<node> q;
signed main()
{
    // freopen("testdata.in","r",stdin);
    T=read();
    while(T--)
    {
        N=read(); K=read(); Q=read();
        vector<vi> sc(N+10,vi(K+10));
        for(int i=1;i<=N;i++) fa[i]=i;
        for(int i=1;i<=K;i++)
        {
            while(!q.empty()) q.pop();
            for(int j=1;j<=N;j++)
            {
                sc[i][j]=read();
                int r=sc[i][j];
                if(i==1) bel[r]=j;
                else
                {
                    while(!q.empty())
                    {
                        auto [id,rk]=q.top(); 
                        if(find(bel[r])<rk) 
                        {
                            // cout << "r=" << r << ", bel=" << find(bel[r]) << ", id=" << id << ", rk=" << rk << '\n';
                            merge(bel[r],bel[id]), q.pop();
                        }
                        else break;
                    }
                    q.push({r,find(bel[r])});
                }
            }
            // cout << "col: "; for(int j=1;j<=N;j++) cout << find(bel[sc[i][j]]) << " "; cout << '\n';
        }
        for(int i=1;i<=N;i++)
            col[i]=find(bel[sc[1][i]]);
        // cout << "col:"; for(int i=1;i<=N;i++) cout << col[i] << " "; cout << '\n';
        for(int i=1;i<=N;i++) num[i]=now[i]=0;
        for(int i=1,pre=0;i<=N;i++)
        {
            pre++;
            now[i]=pre;
            if(col[i+1]!=col[i]) num[col[i]]=pre, pre=0;
        }
        for(int i=1,pre=0;i<=N;i++)
        {
            ans[i]=pre+now[i]*(now[i]-1)/2;
            if(now[i]==num[col[i]]) pre=ans[i];
        }
        int bef=0;
        while(Q--)
        {
            int id=read(), l=read(), r=read();
            id=(id+bef)%K+1;
            l=(l+bef)%N+1;
            r=(r+bef)%N+1;
            int L=r-l+1;
            if(col[r]==col[l]) bef=L*(L-1)/2;
            else
            {
                int cnum=num[col[l-1]];
                int len=now[l-1];
                int a0=len*(len-1)/2, a1=cnum*(cnum-1)/2;
                // cout << "a0=" << a0 << ", a1=" << a1 << ", a2=" << a2 << ", ar=" << ans[r] << ", al=" << ans[l-1] << '\n';
                if(now[l-1]==cnum) bef=ans[r]-ans[l-1];
                else bef=ans[r]-ans[l-1]-a0+a1;
            }
            cout << bef << '\n';
        }
        for(int i=1;i<=N;i++) num[i]=now[i]=ans[i]=col[i]=fa[i]=bel[i]=0;
    }
    return (0-0);
}