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

struct SCC {
    vector<int>dfn, low, scc, siz;
    vector<int>stk, instk;
    vector<vector<int>>e, g;
    int n, tot, cnt;
    SCC() {};
    SCC(int n) {
        this->n = n;
        dfn.resize(n + 1);
        low.resize(n + 1);
        scc.resize(n + 1);
        instk.resize(n + 1);
        siz.resize(n + 1);
        e.assign(n + 1, {});
        g.assign(n + 1, {});
        tot = cnt = 0;
    }

    void add(int a, int b) {
        e[a].push_back(b);
    }

    void work() {
        for (int i = 1;i <= n;i++) {
            if (!dfn[i])
                tarjan(i);
        }
    }

    void tarjan(int u) {
        dfn[u] = low[u] = ++tot;
        stk.push_back(u);
        instk[u] = 1;
        for (int v : e[u]) {
            if (!dfn[v]) {
                tarjan(v);
                low[u] = min(low[u], low[v]);
            }
            else if (instk[v]) {
                low[u] = min(dfn[v], low[u]);
            }
        }
        if (dfn[u] == low[u]) {
            ++cnt;int v;
            do {
                v = stk.back();stk.pop_back();
                instk[v] = 0;
                scc[v] = cnt;
                g[cnt].push_back(v);
                siz[cnt]++;
            } while (v != u);
        }
    }

    struct Graph {
        int n;
        vector<vector<int>>ne;
        vector<int>indeg;
    };

    Graph compass() {
        Graph G;
        G.n = cnt;
        G.indeg.resize(cnt + 1);
        G.ne.resize(cnt + 1);
        for (int u = 1;u <= n;u++) {
            for (int v : e[u]) {
                if (scc[v] == scc[u])continue;
                G.ne[scc[u]].push_back(scc[v]);
                G.indeg[scc[v]]++;
            }
        }
        return G;
    }
};
using LL = long long;

void solve() {
    int n, k, q;
    cin >> n >> k >> q;
    vector a(k + 1, vector<int>(n + 1));
    for (int t = 1;t <= k;t++) {
        for (int i = 1;i <= n;i++) {
            cin >> a[t][i];
        }
    }
    SCC scc(n);
    map<pair<int, int>, int>hav;
    for (int t = 1;t <= k;t++) {
        for (int i = 1;i < n;i++) {
            if (!hav.count({ a[t][i],a[t][i + 1] })) {
                scc.add(a[t][i], a[t][i + 1]);
                // cerr << " " << t << " " << i << "\n";
                // cerr << a[t][i] << " " << a[t][i + 1] << "\n";
            }
            hav[{a[t][i], a[t][i + 1]}] = 1;


        }
    }
    scc.work();
    auto g = scc.compass();
    // for (int i = 1;i <= n;i++) {
    //     cerr << scc.scc[i] << " ";
    // }
    // cerr << "\n";

    vector<LL>pre(n + 1);
    unordered_map<int, int>mp;
    for (int i = 1;i <= n;i++) {
        int x = a[1][i];
        if (mp.count(scc.scc[x])) {
            pre[i] = pre[i - 1] + mp[scc.scc[x]];
        }
        else {
            pre[i] = pre[i - 1];
        }
        mp[scc.scc[x]]++;
        // cout << scc.scc[x] << " ";

    }
    // cout << "\n";
    // for (int i = 1;i <= n;i++) {
        // cout << pre[i] << " ";
    // }
    // cout << "\n";
    LL v = 0;
    while (q--) {
        LL id, l, r;
        cin >> id >> l >> r;
        id = (id + v) % k + 1, l = (l + v) % n + 1, r = (r + v) % n + 1;
        if (l > r)swap(l, r);
        // cout << l << " " << r << "\n";
        v = pre[r] - pre[l];
        // cout << pre[r] << " " << pre[l] << "\n";
        cout << v << "\n";
    }

}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif
    cin >> T;
    while (T--)
        solve();
    return 0;
}