#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>

// #define db(args...) {\
//     string _s = #args;replace(_s.begin(), _s.end(), ',', ' ');\
//     stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); cout << '\n';}
// void err(istream_iterator<string> it){}
// template<typename T, typename... Args>
// void err(istream_iterator<string> it, T a, Args... args) {
//     cout << *it << " = " << a << ' ';
//     err(++it, args...);
// }
int n,k,q;
#define MAX 500005
vector<int> rk[MAX];
vector<int> e[MAX];
int dfn[MAX],low[MAX],sz;
int st[MAX],top;
int group[MAX],gr;
void tarjan(int x){
    dfn[x]=low[x]=++sz;
    st[++top]=x;
    for(auto y:e[x]){
        if(!dfn[y]){
            tarjan(y);
            low[x]=min(low[x],low[y]);
        }else if(!group[y]) low[x]=min(low[x],dfn[y]);
    }
    if(dfn[x]==low[x]){
        group[x]=++gr;
        while(st[top]!=x){
            group[st[top]]=gr;
            top--;
        }top--;
    }
}
void add(int x,int y){
    e[x].push_back(y);
}
#define ll long long
vector<ll> rgt[MAX],qz[MAX];
vector<int> pos[MAX],bk_rgt[MAX];
ll pw(ll x){
    return x*(x-1)/2;
}
void solve(){
    cin>>n>>k>>q;
    for(int i=1;i<=n;i++){
        e[i].clear();dfn[i]=low[i]=group[i]=0;
    }
    for(int i=1;i<=k;i++){
        rk[i].resize(n);
        for(int j=0;j<n;j++){
            cin>>rk[i][j];
            if(j) add(rk[i][j-1],rk[i][j]);
        }
    }sz=gr=0;
    for(int i=1;i<=n;i++) if(!dfn[i]) tarjan(i);
    //cout<<"mid"<<endl;
    //for(int i=1;i<=n;i++) cout<<group[i]<<" ";
    //cout<<endl;
    for(int i=1;i<=k;i++){
        rgt[i].resize(n);
        pos[i].resize(n);
        rgt[i][n-1]=n-1;
        for(int j=n-2;j>=0;j--){
            if(group[rk[i][j]]==group[rk[i][j+1]])
                rgt[i][j]=rgt[i][j+1]; 
            else rgt[i][j]=j;
        }
        //cout<<"rgt:"<<endl;
        //for(int j=0;j<n;j++) cout<<rgt[i][j]<<" ";
        //cout<<endl;
        int cnt=0;
        qz[i].clear();
        bk_rgt[i].clear();
        ll sm=0;
        for(int j=0;j<n;j++){
            pos[i][rgt[i][j]]=cnt++;
            bk_rgt[i].push_back(rgt[i][j]);
            sm+=pw(rgt[i][j]-j+1);
            //cout<<"FKKK:"<<j<<" "<<sm<<endl;
            qz[i].push_back(sm);
            j=rgt[i][j];
        }
    }
    ll ans=0;
    for(int i=1;i<=q;i++){
        ll id,l,r;
        cin>>id>>l>>r;
        id=(id+ans)%k+1;
        l=(l+ans)%n+1;r=(r+ans)%n+1;
        if(l>r) swap(l,r);
        l--,r--;
        //cout<<"query:"<<id<<" "<<l<<" "<<r<<endl;
        if(group[rk[id][l]]==group[rk[id][r]]){
            ans=pw(r-l+1);
        }else{
            int aa=pos[i][rgt[i][l]],bb=pos[i][rgt[i][r]];
            //cout<<"aa="<<aa<<" "<<bb<<endl;
            ans=qz[i][bb-1]-qz[i][aa];
            ans+=pw(rgt[i][l]-l+1);
            ans+=pw(r-bk_rgt[i][bb-1]);
        }
        cout<<ans<<"\n";
    }
}   
signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}
/*
g++ f.cpp -std=c++20 -o f && ./f < in.txt > out.txt
*/