#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = double;
using ull = unsigned long long;

int N,K,Q;
vector<int>Map[200001];
struct edge
{
    int Next,To;
}Edge[200001];
int Head[200001],Lon;
int Low[200001],Dfn[200001],Time;
int Stack[200001],Top;
int Vis[200001];
int Color[200001];
vector<ll>Div,Pre;
void Clear()
{
    Time=Lon=0;
    for(int i=1;i<=N;++i)
    {
        Head[i]=Low[i]=Dfn[i]=Color[i]=0;
    }
}
void Make(int From,int To)
{
    Edge[++Lon].Next=Head[From];
    Edge[Lon].To=To;
    Head[From]=Lon;
}
void Tarjan(int Pos)
{
    Dfn[Pos]=Low[Pos]=++Time;
    Stack[++Top]=Pos;
    Vis[Pos]=1;
    for(int i=Head[Pos];i;i=Edge[i].Next)
    {
        int To=Edge[i].To;
        if(!Dfn[To])
        {
            Tarjan(To);
            Low[Pos]=min(Low[Pos],Low[To]);
        }
        else if(Vis[To])
        Low[Pos]=min(Low[To],Low[Pos]);
    }
    if(Dfn[Pos]==Low[Pos])
    {
        for(int i=Stack[Top--];i;i=Stack[Top--])
        {
            Color[i]=Pos;
            Vis[i]=0;
            if(i==Pos)break;
        }
    }
}
void solve() {
    scanf("%d%d%d",&N,&K,&Q);
    for(int i=1;i<=K;++i)
    {
        Map[i].clear();
        Map[i].push_back(0);
        for(int j=1;j<=N;++j)
        {
            int X;
            scanf("%d",&X);
            Map[i].push_back(X);
        }
        for(int j=1;j<N;++j)
        Make(Map[i][j],Map[i][j+1]);
    }
    for(int i=1;i<=N;++i)
    if(!Dfn[i])Tarjan(i);
    Pre.clear();
    Div.clear();
    Pre.push_back(0);
    Div.push_back(0);
    int Bef;
    ll Length;
    for(int j=1;j<=N;++j)
    {
        if(Color[Map[1][j]]!=Color[Map[1][j-1]])
        {
            Bef=Pre.size();
            Length=(j-Div[Bef-1]);
            Pre.push_back(Pre[Bef-1]+(Length*(Length-1)>>1));
            Div.push_back(j);
        }
    }
    Bef=Pre.size();
    Length=(N+1-Div[Bef-1]);
    Pre.push_back(Pre[Bef-1]+(Length*(Length-1)>>1));
    Div.push_back(N+1);
    ll Last=0;
    while(Q--)
    {
        ll Id,L,R;
        scanf("%lld%lld%lld",&Id,&L,&R);
        Id=(Id+Last)%K+1;
        L=(L+Last)%N+1,R=(R+Last)%N+1;
        if(Color[L]==Color[R])
        {
            Length=R-L+1;
            Last=Length*(Length-1)>>1;
        }
        else
        {
            int Left=upper_bound(Div.begin(),Div.end(),L)-Div.begin();
            int Right=upper_bound(Div.begin(),Div.end(),R)-Div.begin();
            Last=Pre[Right-2]-Pre[Left-1];
            Length=Div[Left]-L;
            Last+=Length*(Length-1)>>1;
            Length=R-Div[Right-1]+1;
            Last+=Length*(Length-1)>>1;
        }
        printf("%lld\n",Last);
    }
}

int main(void){
	int T;
    scanf("%d",&T);
    while (T--) 
    {
        Clear();
        solve();
    }
	return 0;
}