#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define rep2(i, l, r) for(ll i = (l); i < (r); ++i)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, auto b) {return a > b ? a = b, 1 : 0;}
bool chmax(auto &a, auto b) {return a < b ? a = b, 1 : 0;}

struct IOS {
  IOS() {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;


template<class T>
void print(vector<T> a) {
  for(auto x : a) cout << x << ' ';
  cout << endl;
}

void print(auto x) {
  cout << x << endl;
}

template<class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}


struct SCC {
  int n;
  vi cmp, order, use;
  vvi g, rg, group;

  SCC(int n, vector<pair<int, int>> edge) :
    n(n), g(n), rg(n), cmp(n, -1), use(n) {
      for(auto [from, to] : edge) {
        g[from].push_back(to);
        rg[to].push_back(from);
      }
      rep(i, n) dfs(i);
      int c = 0;
      rep(i, n) c += rdfs(order[n-1-i], c);
      group.resize(c);
      rep(i, n) group[cmp[i]].push_back(i);
    }
  
  void dfs(int v) {
    if(use[v]) return;
    use[v] = 1;
    for(auto to : g[v]) dfs(to);
    order.push_back(v);
  }
  int rdfs(int v, int c) {
    if(cmp[v] != -1) return 0;
    cmp[v] = c;
    for(auto to : rg[v]) rdfs(to, c);
    return 1;
  }
};

void solve(){
  int N,K,Q;
  cin>>N>>K>>Q;
  vector<vector<int>> P(K,vector<int> (N));
  vector<pair<int,int>> edge;
  rep(i,K){
    rep(j,N){
      cin>>P[i][j];
      P[i][j]--;
      if(j!=0){
        edge.push_back({P[i][j-1],P[i][j]});
      }
    }
  }
  SCC S(N,edge);
  auto VV=S.group;
  vector<int> U(N,0);
  ll VN=VV.size();
  vector<ll> GS(VN+1,0);
  vector<ll> GS2(VN+1,0);
  rep(i,VN){
    for(int v:VV[i])U[v]=i;
    ll vn=VV[i].size();
    GS[i+1]=vn+GS[i];
    GS2[i+1]=vn*(vn-1)/2+GS2[i];
  }
  ll v=0;
  rep(q,Q){
    ll id,l,r;
    cin>>id>>l>>r;
    id=(id+v)%K;
    l=(l+v)%N;
    r=(r+v)%N;
    
    ll an=0;
    if(U[l]==U[r]){
      ll len=r-l+1;
      an=len*(len-1)/2;
    }
    else{
      if(U[l]+1<U[r]){
        an+=GS2[U[r]]-GS2[U[l]+1];
      }
      ll L=GS[U[l]+1]-l;
      ll R=r-GS[U[r]]+1;
      an+=L*(L-1)/2+R*(R-1)/2;
    }

    cout<<an<<"\n";
    v=an;
  }

}




int main(){
  int T;
  cin>>T;
  while(T--)solve();
}