#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
#define endl "\n"

const int maxn = 2e5 + 7, oo = 1e18 + 7;

int val[maxn];

int n, m, q;
vector<int> a[maxn];
set<int> edge[maxn];

unordered_map<int, int> mp;
int idx = 0;

int b[maxn], vis[maxn];

void dfs(int x)
{
	// cout << " -> " << x << endl;
	b[x] = x, vis[x] = 1;

	for (int y : edge[x])
	{
		// cout << "?" << y << endl;

		if (!vis[y])
			dfs(y);

		b[x] = min(b[x], b[y]);
	}
}

void solve()
{
	cin >> n >> m >> q;

	mp.clear(), idx = 0;
	for (int i = 1; i <= n; i++)
		edge[i].clear(), vis[i] = 0;

	for (int j = 1; j <= m; j++)
	{
		a[j].clear(), a[j].push_back(-1);
		for (int i = 1; i <= n; i++)
		{
			int x;
			cin >> x;
			if (!mp[x])
				mp[x] = ++idx;
			a[j].push_back(mp[x]);

			if (i > 1)
			{
				// cout << a[j][i - 1] << " ->>> " << a[j][i] << endl;
				edge[a[j][i - 1]].insert(a[j][i]);
			}
		}
	}

	// for (int j = 1; j <= m; j++)
	// {
	// 	for (int i = 1; i <= n; i++)
	// 		cout << a[j][i] << " ";
	// 	cout << endl;
	// }

	dfs(1);

	// for (int j = 1; j <= m; j++)
	// 	for (int i = 2; i <= n; i++)
	// 		b[a[j][i - 1]] = min(b[a[j][i - 1]], a[j][i]);
	// for (int i = n; i >= 1; i--)
	// 	b[i] = min(b[i + 1], b[i]);

	// for (int i = 1; i <= n; i++)
	// 	cout << b[i] << " ";
	// cout << endl;

	map<int, int> qj;
	qj[0] = 0;
	int now = 1;
	while (now <= n)
	{
		int j = now;
		while (j < n && b[j + 1] == b[now])
			j++;
		qj[now] = qj.rbegin()->second + val[j - now + 1];
		now = j + 1;
	}
	qj[n + 1] = qj.rbegin()->second;

	// for (auto i : qj)
	// {
	// 	cout << i.first << " " << i.second << endl;
	// }

	int ans = 0;
	while (q--)
	{
		int x, l, r;
		cin >> x >> l >> r;

		x = ((x + ans) % m) + 1;
		l = ((l + ans) % n) + 1;
		r = ((r + ans) % n) + 1;

		// cout << "{ " << x << " " << l << " " << r << endl;

		auto ll = qj.lower_bound(l);
		auto rr = -- --qj.upper_bound(r + 1);

		// cout << "[ " << ll->first << " " << rr->first << " " << endl;

		// cout << ll << "~" << rr << endl;

		int res = 0;

		if ((--ll)->first <= rr->first)
		{
			res += rr->second - ll->second;
			int qr = (++ll)->first - 1, ql = (++rr)->first;
			res += val[max(qr - l + 1, 0ll)];
			res += val[max(r - ql + 1, 0ll)];
		}
		else
		{
			// int ql = l, qr = r;
			// while (ql < qr)
			// {
			// 	int mid = (ql + qr + 1) / 2;
			// 	if (b[l] == b[mid])
			// 		ql = mid;
			// 	else
			// 		qr = mid - 1;
			// }
			// res += val[max(ql - l + 1, 0ll)];
			// res += val[max(r - (ql + 1) + 1, 0ll)];
			res += val[max(r - l + 1, 0ll)];
		}

		// cout << qj[rr] - qj[ll1] << endl;

		cout << res << endl;

		ans = res;
	}
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cout << fixed << setprecision(10);

	val[0] = 0;
	for (int i = 1; i < maxn; i++)
		val[i] = val[i - 1] + i - 1;

	int t = 1;
	cin >> t;
	while (t--)
		solve();

	return 0;
}