#include<bits/stdc++.h>
#define ll long long
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=2e5+10,MAXM=310;
int T,n,k,q,t,bl,in[MAXN],low[MAXN],dfn[MAXN],col[MAXN],cls,bel[MAXN],L[MAXM],R[MAXM],cnt[MAXN],c[MAXN];
vector<int> p[MAXN],G[MAXN];
stack<int> st;
void tarjan(int u) {
	st.push(u),dfn[u]=low[u]=++t,in[u]=1;
	for(auto v:G[u]) {
		if(!dfn[v]) tarjan(v),low[u]=min(low[u],low[v]);
		else if(in[v]) low[u]=min(low[u],dfn[v]);
	}
	if(dfn[u]==low[u]) {
		++cls;
		while(1) {
			int v=st.top();
			st.pop(),col[v]=cls,in[v]=0;
			if(u==v) break ;
		}
	}
	return ;
}
ll sum[MAXM][MAXM];
int pre[MAXM][MAXN];
ll query(int l,int r) {
	if(bel[l]==bel[r]) {
		ll ans=0;
		ffor(j,l,r) ans+=cnt[c[j]],cnt[c[j]]++;
		ffor(j,l,r) cnt[c[j]]=0;
		return ans;	
	}
	ll ans=sum[bel[l]+1][bel[r]-1];
	ffor(j,L[bel[r]],r) ans+=pre[bel[r]-1][c[j]]-pre[bel[l]][c[j]]+cnt[c[j]],cnt[c[j]]++;
	ffor(j,l,R[bel[l]]) ans+=pre[bel[r]-1][c[j]]-pre[bel[l]][c[j]]+cnt[c[j]],cnt[c[j]]++;
	ffor(j,L[bel[r]],r) cnt[c[j]]=0;
	ffor(j,l,R[bel[l]]) cnt[c[j]]=0;
	return ans;
}
int main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>T;
	while(T--) {
		cin>>n>>k>>q;
		ffor(i,1,k) p[i].clear();
		ffor(i,1,n) G[i].clear();
		ffor(i,1,k) {
			int lst=0,id;
			p[i].push_back(0);
			ffor(j,1,n) {
				cin>>id;
				if(lst) G[lst].push_back(id);
				lst=id,p[i].push_back(id);
			}
		}
		cls=0,t=0;
		ffor(i,1,n) in[i]=dfn[i]=low[i]=col[i]=0;
		ffor(i,1,n) if(!dfn[i]) tarjan(i);
		bl=(n*k+299)/300;
		ffor(i,1,bl) L[i]=(i-1)*300+1,R[i]=i*300;
		R[bl]=n*k;
		ffor(i,1,k) ffor(j,1,n) c[(i-1)*n+j]=col[p[i][j]];
		ffor(i,1,bl) ffor(j,L[i],R[i]) bel[j]=i;
		ffor(i,1,bl) {
			ll ans=0;
			ffor(j,i,bl) {
				ffor(t,L[j],R[j]) ans+=cnt[c[t]],cnt[c[t]]++;
				sum[i][j]=ans;
			}
			ffor(k,1,cls) pre[i][k]=pre[i-1][k];
			ffor(j,L[i],R[i]) pre[i][c[j]]++;
			ffor(k,1,cls) cnt[k]=0;
		}
		ll ans=0;
		ffor(i,1,q) {
			ll id,l,r;
			cin>>id>>l>>r;
			id=(id+ans)%k+1;
			l=(l+ans)%n+1;
			r=(r+ans)%n+1;
			cout<<(ans=query((id-1)*n+l,(id-1)*n+r))<<'\n';
		}
	}
	return 0;
}