#include <bits/stdc++.h>

using namespace std;
using ll = long long;

template <int D, typename T>
struct Vec : public vector<Vec<D - 1, T>> {
    static_assert(D >= 1, "Dimension must be positive");
    template <typename... Args>
    Vec(int n = 0, Args... args) : vector<Vec<D - 1, T>>(n, Vec<D - 1, T>(args...)) {}
};

template <typename T>
struct Vec<1, T> : public vector<T> {
    Vec(int n = 0, T val = T()) : std::vector<T>(n, val) {}
};

ll zs(int len){
    return ll(len - 1) * len / 2;
}

void process(){
    int n, k, q; cin >> n >> k >> q;
    Vec <2, int> a(k, n);
    for (int i = 0; i < k; ++ i){
        for (int j = 0; j < n; ++ j) {
            cin >> a[i][j];
            a[i][j] --;
        }
    }

    vector <int> cnt(n, 0), used(n, 0);
    int nap = 0, nca = 0;
    vector <int> dv = {-1};
    for (int j = 0; j < n; ++ j){
        for (int i = 0; i < k; ++ i){
            int v = a[i][j];
            nap += (!used[v]);
            used[v] = 1;
            cnt[v] ++;
            nca += (cnt[v] == k);
        }

        if (nap == nca) dv.push_back(j);
    }

    int nbl = dv.size();
    vector <long long> pref(nbl, 0);
    for (int i = 1; i < nbl; ++ i){
        int len = dv[i] - dv[i - 1];
        pref[i] = pref[i - 1] + zs(len);
    }

    ll lastans = 0;
    while (q --){
        int id, l, r;
        cin >> id >> l >> r;
        l = (lastans + l) % n;
        r = (lastans + r) % n;

        int v = upper_bound(dv.begin(), dv.end(), r) - dv.begin() - 1;
        int u = lower_bound(dv.begin(), dv.end(), l) - dv.begin();

        lastans = pref[v] - pref[u];
        lastans += zs(r - dv[v]) + zs(dv[u] - l + 1);

        cout << lastans << "\n";
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int t; cin >> t; while (t --)
    process();

    return 0;
}