#include <bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;
const int maxn = 1e6 + 5;
class tarjan {
public :
    vector<int> stk;
    vector<int> fdn, low, color;
    vector<bool> vis;
    vector<vector<int>> to;
    int cnt = 0, step = 0;
    int _n;
    void add_edge(int u, int v)
    {
        to[u].push_back(v);
    }
    tarjan(int n)
    {

        _n = n;
        fdn.assign(n, 0);
        low.assign(n, 0);
        color.assign(n, 0);
        vis.assign(n, 0);
        to.assign(n, vector<int>());
    }
    void dfs(int x)
    {
        vis[x] = 1;
        fdn[x] = low[x] = ++step;
        stk.push_back(x);
        for (auto i : to[x])
        {
            int v = i;
            if (!fdn[v])
            {
                dfs(v);
                low[x] = min(low[v], low[x]);
            }
            else if (vis[v])
            {
                low[x] = min(low[x], fdn[v]);
            }
        }
        if (fdn[x] == low[x])
        {
            vis[x] = 0;
            color[x] = ++cnt;
            int i = stk.size() - 1;
            while (stk[i] != x)
            {
                vis[stk[i]] = 0;
                color[stk[i]] = cnt;
                stk.pop_back();
                i--;
            }
            stk.pop_back();
        }
    }
    auto work()
    {
        for (int i = 1; i < _n; i++)
        {
            if (!fdn[i])
                dfs(i);
        }
        return color;
    }
};
void solve() {
    int n, k, q; cin >> n >> k >> q;
    tarjan tar(n + 1);
    vector< vector< int > > a(k + 1, vector< int >(n + 1, 0));
    vector< vector< int > > c(k + 1, vector< int >(n + 1, 0));

    vector< vector< int > > lst(k + 1, vector< int >(n + 2, 0));
    vector< vector< int > > nxt(k + 1, vector< int >(n + 2, 0));
    vector< vector< int > > pre(k + 1, vector< int >(n + 2, 0));

    for(int i = 1; i <= k; i++) {
        for(int j = 1; j <= n; j++) {
            cin >> a[i][j];
            if(j != 1) {
                tar.add_edge(a[i][j - 1], a[i][j]);
            }
        }
    }
    vector< int > col = tar.work();
    for(int i = 1; i <= k; i++) {
        for(int j = 1; j <= n; j++) {
            c[i][j] = col[a[i][j]];
        }
    }
    
    for(int i = 1; i <= k; i++) {
        int cur = 0, pc = 0;
        for(int j = 1; j <= n; j++) {
            if(c[i][j] == c[i][j - 1]) {
                nxt[i][j] = nxt[i][j - 1];
                cur++;
            }
            else {
                pre[i][j - 1] = pre[i][pc] + cur * (cur - 1) / 2;
                nxt[i][j] = j;
                cur = 1; pc = j - 1;
            }
        }
        for(int j = n; j >= 1; j--) {
            if(c[i][j] == c[i][j + 1]) {
                lst[i][j] = lst[i][j + 1];
            }
            else {
                lst[i][j] = j;
            }
        }

    }

    int ans = 0;
    while(q--) {
        int id, l, r; cin >> id >> l >> r;
        id = (id + ans) % k + 1;
        l = (l + ans) % n + 1;
        r = (r + ans) % n + 1;
        
        int l_ = lst[id][l];
        if(l_ >= r) {
            int len = (r - l + 1);
            ans = len * (len - 1) / 2;
        }
        else {
            int r_ = nxt[id][r];
            int len1 = (l_ - l + 1);
            int len2 = (r - r_ + 1);
            ans = len1 * (len1 - 1) / 2 + len2 * (len2 - 1) / 2 + pre[id][r_ - 1] - pre[id][l_];
        }

        cout << ans << '\n';
    }  
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}