#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
struct DSU {
    vector<int> a;
    vector<int> sz;
    DSU(int n) : a(vector<int>(n)), sz(vector<int>(n, 1)) {
        for (int i = 0; i < n; ++i) a[i] = i;
    }
    int find(int x) { return a[x] = x == a[x] ? x : find(a[x]); }
    int merge(int u, int v) {
        u = find(u);
        v = find(v);
        if (u > v) swap(u, v);
        if (u == v) return 0;
        a[v] = u;
        sz[u] += sz[v];
        return 1;
    }
};
using pii = pair<int, int>;
int cn2(int x) {
    return 1ll * x * (x - 1) / 2;
}

void solve() {
    int n, k, q;
    cin >> n >> k >> q;
    vector<int> p(n + 1);
    DSU f(n + 1);
    for (int i = 1, u; i <= n; ++i) cin >> u, p[u] = i;
    vector<pii> link;
    for (int _ = 1; _ < k; ++_) {
        vector<int> tmp(n);
        for (int i = 0, u; i < n; ++i) cin >> u, tmp[i] = p[u];

        for (int i = 1; i < n; ++i) {
            if (tmp[i - 1] > tmp[i]) link.push_back({tmp[i], tmp[i - 1]});
        }
    }
    sort(link.begin(), link.end());

    vector<int> a;
    vector<ll> b = {0};
    for (int i = 0, cur = 0; i < link.size(); ++i) {
        while (cur < link[i].first) {
            a.push_back(cur);
            cur++;
        }
        cur = max(link[i].second, cur);
    }
    a.push_back(n);
    for (int i = 1; i < a.size(); ++i) {
        ll t1 = a[i] - a[i - 1];
        b.push_back(b.back() + cn2(t1));
    }
    auto get = [&](int i) -> int {
        return lower_bound(a.begin(), a.end(), i) - a.begin() - 1;
    };
    for (ll i = 0, v = 0; i < q; ++i) {
        int id, l, r;
        cin >> id >> l >> r;
        id = (id + v) % k + 1;
        l = (l + v) % n + 1;
        r = (r + v) % n + 1;
        // cout << "query" << l << " " << r << '\n';
        int i1 = get(l);
        int i2 = get(r);
        if (i1 == i2) {
            int num = r - l + 1;
            v = cn2(num);
        } else {
            v = b[i2] - b[i1 + 1];
            v += cn2(a[i1 + 1] - l + 1);
            v += cn2(r - a[i2]);
        }
        cout << v << '\n';
    }
}

int main() {
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
    int t;
    cin >> t;
    while (t--) solve();
}
/*
2
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

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

*/