#include<bits/stdc++.h>
#define endl '\n'
#define int long long
#define rep(i, a, b) for(int i = a; i <= b; i ++ )
#define pre(i, a, b) for(int i = a; i >= b; i -- )
using namespace std;
const int N = 1e6 + 10;
int n, m, k, q;
int stk[N], instk[N], top, cnt, id[N], dfn[N], low[N], times, sz[N], idx;
vector<int>p[N], pp[N], ppp[N], res[N];
void tarjan(int u)
{
    dfn[u] = low[u] = ++times;
    stk[++top] = u, instk[u] = 1;
    for(auto j : p[u])
    {
        if(!dfn[j]) tarjan(j), low[u] = min(low[u], low[j]);
        else if(instk[j]) low[u] = min(low[u], dfn[j]);
    }
    if(dfn[u] == low[u])
    {
        cnt ++ ;
        int y;
        do
        {
            y = stk[top -- ];
            id[y] = cnt;
            sz[cnt] ++ ;
            instk[y] = 0;
        }while(y != u);
    }
}
int f[N], num[N], in[N], sum[N], w[N];
void solve()
{
    idx = 0;
    cin >> n >> k >> q;
    rep(i, 1, n) p[i].clear(), id[i] = 0, sz[i] = 0, in[i] = 0, f[i] = 0, ppp[i].clear(), res[i].clear(), sum[i] = 0, w[i] = 0, num[i] = 0, pp[i].clear(), stk[i] = 0, instk[i] = 0, dfn[i] = 0, low[i] = 0;
    times = 0, cnt = 0, top = 0;
    rep(i, 1, k)
    {
        int last = 0;
        rep(j, 1, n)
        {
            int x;
            cin >> x;
            pp[i].push_back(x);
            if(last) p[last].push_back(x);
            last = x;
        }
    }
    rep(i, 1, n) if(!dfn[i]) tarjan(i);
    rep(i, 1, n) ppp[id[i]].push_back(i);
    rep(i, 1, n)
    {
        for(auto j : p[i])
        {
            if(id[i] != id[j])
            {
                f[id[j]] = id[i], in[id[i]] ++ ;
            }
        }
    }
    rep(i, 1, cnt)
    {
        if(!in[i])
        {
            while(i)
            {
                num[++idx] = i;
                i = f[i];
            }
            break;
        }
    }
    rep(i, 1, idx / 2) swap(num[i], num[idx - i + 1]);
    rep(i, 1, idx)
    {
        // cout<<num[i];
        sum[i] = sum[i - 1] + (sz[num[i]] * (sz[num[i]] - 1)) / 2;
        for(auto it : ppp[num[i]])
        {
            w[it] = i;
        }
    }
    rep(i, 1, k)
    {
        for(auto it : pp[i])
        {
            res[i].push_back(w[it]);
        }
    }
    int last = 0, op, l, r;
    // for(auto it : res[1])cout<<it<<" ";
    // cout<<cnt;
    while(q -- )
    {
        cin >> op >> l >> r;
        op = (op + last) % k + 1;
        l = (l + last) % n + 1;
        r = (r + last) % n + 1;
        // cout<<op<<" "<<l<<" "<<r<<endl;
        if(id[l] == id[r])
        {
            int z = r - l + 1;
            cout << (z * (z - 1)) / 2 << endl;
            last = (z * (z - 1)) / 2;
        }
        else
        {
            int ans = 0;
            int tl = upper_bound(res[op].begin(), res[op].end(), w[pp[op][l - 1]]) - res[op].begin() + 1;
            tl -- ;
            // cout<<tl;
            ans += (tl - l + 1) * (tl - l) / 2;
            int tr = lower_bound(res[op].begin(), res[op].end(), w[pp[op][r - 1]]) - res[op].begin() + 1;
            ans += (r - tr + 1) * (r - tr) / 2;
            if(id[r] - id[l] > 1) ans += sum[id[r] - 1] - sum[id[l]];
            cout << ans << endl;
            last = ans;
        }
    }
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int _;
    _ = 1;
    cin >> _;
    while(_ -- )
    {
        solve();
    }
    return 0;
}