#include<bits/stdc++.h>

using namespace std;   

#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i = int(l); i < int(r); i++)
#define sz(a) int((a).size())

typedef long long li;

int n, k, m;
vector<vector<int>> a;

bool read() {
	if (!(cin >> n >> k >> m))
		return false;
	a.resize(k);
	forn(i, k){
		a[i].resize(n);
		forn(j, n){
			cin >> a[i][j];
			--a[i][j];
		}
	}
	return true;
}

mt19937_64 rnd64(42);
typedef unsigned long long uli;

void solve() {
	vector<uli> val(n);
	forn(i, n) val[i] = rnd64();
	vector<pair<int, int>> seg;
	vector<uli> cur(k);
	int l = 0;
	forn(r, n){
		forn(i, k) cur[i] ^= val[a[i][r]];
		if (count(cur.begin(), cur.end(), cur[0]) == k){
			seg.push_back({l, r});
			cur.assign(k, 0);
			l = r + 1;
		}
	}
	vector<int> pr(n + 1);
	vector<int> nxt(n + 1, -1), prv(n, -1);
	for (auto [l, r] : seg){
		pr[l + 1] += (r - l) * li(r - l + 1) / 2;
		nxt[l] = l;
		prv[r] = r;
	}
	nxt[n] = n;
	fore(i, 1, n) if (prv[i] == -1) prv[i] = prv[i - 1];
	for (int i = n - 1; i >= 0; --i) if (nxt[i] == -1) nxt[i] = nxt[i + 1];
	forn(i, n) pr[i + 1] += pr[i];
	li v = 0;
	forn(i, m){
		int id, l, r;
		cin >> id >> l >> r;
		id = (id + v) % k + 1;
		l = (l + v) % n;
		r = (r + v) % n;
		li nv = pr[r + 1] - pr[l];
		nv += (nxt[l] - l) * li(nxt[l] - l - 1) / 2;
		if (r != prv[r]){
			nv -= ((nxt[r + 1] - 1) - (prv[r] + 1)) * li((nxt[r + 1] - 1) - (prv[r] + 1) + 1) / 2;
			nv += (r - prv[r]) * li(r - prv[r] - 1) / 2;
		}
		cout << nv << '\n';
		v = nv;
	}
}

int main() {
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int t = 1;
	cin >> t;
	forn(i, t) {
	 	read();
		solve();
	}
}