#include<bits/stdc++.h>
using namespace std;
using ll = long long;
struct SCC {
    int n;
    std::vector<std::vector<int>> adj;
    std::vector<int> stk;
    std::vector<int> dfn, low, bel;
    int cur, cnt;

    SCC() {}
    SCC(int n) {
        init(n);
    }

    void init(int n) {
        this->n = n;
        adj.assign(n, {});
        dfn.assign(n, -1);
        low.resize(n);
        bel.assign(n, -1);
        stk.clear();
        cur = cnt = 0;
    }

    void addEdge(int u, int v) {
        adj[u].push_back(v);
    }

    void dfs(int x) {
        dfn[x] = low[x] = cur++;
        stk.push_back(x);

        for (auto y : adj[x]) {
            if (dfn[y] == -1) {
                dfs(y);
                low[x] = std::min(low[x], low[y]);
            } else if (bel[y] == -1) {
                low[x] = std::min(low[x], dfn[y]);
            }
        }

        if (dfn[x] == low[x]) {
            int y;
            do {
                y = stk.back();
                bel[y] = cnt;
                stk.pop_back();
            } while (y != x);
            cnt++;
        }
    }

    std::vector<int> work() {
        for (int i = 0; i < n; i++) {
            if (dfn[i] == -1) {
                dfs(i);
            }
        }
        return bel;
    }
};
void solve() {
    int n, k, q;
    cin >> n >> k >> q;
    vector<vector<int>>a(k, vector<int>(n));
    SCC e(n);
    for (int i = 0; i < k; i++) {
        for (int j = 0; j < n; j++) {
            cin >> a[i][j];
            a[i][j]--;
            if (j)e.addEdge(a[i][j - 1], a[i][j]);
        }
    }
    vector<int>f = e.work();
    vector<ll>s(n + 1, 0);
    auto wk = [&](ll x) {
        return x * (x - 1) / 2;
    };
    int lasr = 0;
    set<int>stl, str;
    stl.insert(1);
    for (int i = 1; i <= n; i++) {
        s[i] = s[i - 1];
        if (i == n || f[a[0][i - 1]] != f[a[0][i]]) {
            if (i != n)stl.insert(i + 1);
            s[i] += wk(i - lasr);
            lasr = i;
            str.insert(i);
        }
    }
    ll res = 0;
    while (q--) {
        int l, r;
        cin >> l >> l >> r;
        l = (l + res) % n + 1;
        r = (r + res) % n + 1;
        ll tres = 0;
        auto it = stl.lower_bound(l);
        if (*it <= r) {
            tres += wk(*it - l);
            l = *it;
        }
        else {
            tres += wk(r - l + 1);
            l = r + 1;
        }
        if (l <= r) {
            auto it = str.upper_bound(r);
            if (it == str.begin()) {
                tres += wk(r - l + 1);
                l = r + 1;
            }
            else {
                it--;
                tres += wk(r - *it);
                r = *it;
            }
        }
        if (r >= l)tres += s[r] - s[l - 1];
        res = tres;
        cout << res << '\n';
    }
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}