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

int T, N, K, Q;
int fa[MX], bel[MX], col[MX], num[MX], now[MX], ans[MX], rt[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;
}
priority_queue<PII> q;
signed main()
{
    // freopen("testdata.in","r",stdin);
    T=read();
    for(int time=1;time<=T;time++)
    {
        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; continue;}
                int in=bel[r];
                while(!q.empty())
                {
                    auto [rk,id]=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();
                        in=max(in,rk);
                    }
                    else break;
                }
                q.push({in,r});              
            }
            // if(time==216&&N==5) {cout << "col: "; for(int j=1;j<=N;j++) cout << find(bel[sc[i][j]]) << " "; cout << "\\";}
            // cout << "col: "; for(int j=1;j<=N;j++) cout << find(bel[sc[i][j]]) << " "; cout << '\n';
        }
        // if(time==216&&N==5) {for(int i=1;i<=K;i++) {for(int j=1;j<=N;j++) cout << sc[i][j] << " "; cout << " &&& ";}}
        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, rt[col[i]]=i;
        }
        // cout << "rt: "; for(int i=1;i<=N;i++) cout << rt[col[i]] << " "; cout << '\n';
        // cout << "now: "; for(int i=1;i<=N;i++) cout << now[i] << " "; cout << '\n';
        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];
        }
        // cout << "ans: "; for(int i=1;i<=N;i++) cout << ans[i] << " "; cout << '\n';
        int bef=0;
        while(Q--)
        {
            int id=read(), l=read(), r=read();
            l=(l+bef)%N+1; r=(r+bef)%N+1;
            int L=r-l+1;
            // if(time==216&&N==5) {cout << "col: "; for(int i=1;i<=N;i++) cout << col[i] << " "; cout << "l=" << l << ", r=" << r << '\n';}
            if(col[r]==col[l]) bef=L*(L-1)/2;
            else
            {
                int p=rt[col[l]];
                int l1=num[col[l]]-now[l]+1;
                int a0=l1*(l1-1)/2;
                if(a0<0||l1<0||p<0) cout << "-1\n";
                // cout << "ar=" << ans[r] << ", ap=" << ans[p] << ", a0=" << a0 << '\n';
                bef=ans[r]-ans[p]+a0;
            }
            cout << bef << '\n';
        }
        for(int i=1;i<=N*K+5;i++) num[i]=now[i]=ans[i]=col[i]=fa[i]=bel[i]=rt[i]=0;
    }
    return (0-0);
}