#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5;
int dfn[N], low[N], tim = 0, stk[N], top = 0, cnt = 0, scc[N], now;
vector <ll> sum[N];
vector<int> id[N], l[N], r[N], rnk[N];
vector <int> E[N], a[N], rk[N];
map <int, bool> mp[N];
bool vis[N];
void tarjan(int u) {
    dfn[u] = low[u] = ++tim;
    stk[++top] = u;
    vis[u] = 1;
    for (int v : E[u]) {
        if (!dfn[v]) {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        } else if (vis[v])
            low[u] = min(low[u], dfn[v]);
    }
    if (low[u] == dfn[u]) {
        ++cnt;
        while (stk[top] != u) {
            scc[stk[top]] = cnt;
            vis[stk[top]] = 0;
            top--;
        }
        scc[stk[top]] = cnt;
        vis[stk[top]] = 0;
        --top;
    }
}
bool cmp(int a, int b) {
    return l[now][a] < l[now][b];
}
void solve() {
    int n, k, q;
    cin >> n >> k >> q;
    for (int i = 1; i <= n; ++i) {
        rk[i].resize(k);
        vis[i] = dfn[i] = low[i] = scc[i] = 0;
        E[i].clear();
        mp[i].clear();
    }
    for (int i = 0; i < k; ++i) {
        a[i].resize(n);
        for (int j = 0; j < n; ++j)
            cin >> a[i][j], rk[a[i][j]][i] = j;
        for (int j = 1; j < n; ++j) {
            if (mp[a[i][j - 1]].count(a[i][j])) continue;
            E[a[i][j - 1]].push_back(a[i][j]);
            mp[a[i][j - 1]][a[i][j]] = 1;
        }
    }
    tim = top = cnt = 0;
    tarjan(1);
    // cout << cnt << endl;
    for (int t = 0; t < k; ++t) {
        l[t].resize(cnt + 1);
        r[t].resize(cnt + 1);
        id[t].resize(cnt + 1);
        sum[t].resize(cnt + 1);
        rnk[t].resize(cnt + 1);
        // cout << t << endl;
        now = t;
        for (int i = 1; i <= cnt; ++i)
            l[t][i] = n, r[t][i] = 0, id[t][i] = i;
        for (int i = 1; i <= n; ++i) {
            int sc = scc[i];
            l[t][sc] = min(l[t][sc], rk[i][t]);
            r[t][sc] = max(r[t][sc], rk[i][t]);
            // cout << i << " " << sc << " " << rk[i][t] << endl;
        }
        sort(id[t].begin() + 1, id[t].end(), cmp);
        for (int i = 1; i <= cnt; ++i)
            rnk[t][id[t][i]] = i;
        sum[t][0] = 0;
        for (int i = 1; i <= cnt; ++i) {
            int L = l[t][id[t][i]], R = r[t][id[t][i]];
            sum[t][i] = sum[t][i - 1] + 1ll * (R - L + 1) * (R - L) / 2;
            // cout << "scc " << i << " " << L << " " << R << endl;
        }
    }
    ll lst = 0;
    while (q--) {
        int ql, qr, i;
        cin >> i >> ql >> qr;
        i = (i + lst) % k;
        ql = (ql + lst) % n;
        qr = (qr + lst) % n;
        // cout << i << " " << ql << " " << qr << endl;
        int s = rnk[i][scc[a[i][ql]]], t = rnk[i][scc[a[i][qr]]];
        int L, R;
        L = max(l[i][scc[a[i][ql]]], ql), R = min(r[i][scc[a[i][ql]]], qr);
        // cout << "qus " << i << " " << s << " " << t << endl;
        ll ans = 0;
        ans += 1ll * (R - L + 1) * (R - L) / 2;
        if (s == t) {
            cout << ans << endl;
            lst = ans;
            continue;
        }
        L = max(l[i][scc[a[i][qr]]], ql), R = min(r[i][scc[a[i][qr]]], qr);
        // cout << L << " " << R << endl;
        ans += 1ll * (R - L + 1) * (R - L) / 2;
        ans += sum[i][t - 1] - sum[i][s];
        cout << ans << endl;
        lst = ans;
    }
}
int main() {
    cin.tie(nullptr) -> ios::sync_with_stdio(false);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--) solve();
    return 0;
}
/*
3
5 2 2
1 2 3 4 5
5 4 3 2 1
1 0 2
1 2 1
5 3 3
1 2 3 4 5
1 3 2 4 5
1 2 3 5 4
0 0 2
0 2 3
1 0 3
3 2 1
1 2 3
1 3 2
0 1 2
*/