#include <bits/stdc++.h>
const long long inf = 1LL << 60;
int n, m, q;
long long a[82][82], E1[82][82][70], E2[82][82][70];
signed main()
{
	scanf("%d%d%d", &n, &m, &q);
	for (int u = 1; u <= n; u++)
		for (int v = 1; v <= n; v++)
			E1[u][v][0] = E2[u][v][0] = (u == v) ? 0 : inf;
	for (int u = 1; u <= n; u++)
		for (int v = 1; v <= n; v++)
			E1[u][v][1] = inf;
	for (int i = 1; i <= m; i++)
	{
		for (int u = 1; u <= n; u++)
			for (int v = 1; v <= n; v++)
				scanf("%lld", &a[u][v]);
		for (int x = 1; x <= n; x++)
			for (int u = 1; u <= n; u++)
				for (int v = 1; v <= n; v++)
					a[u][v] = std::min(a[u][v], a[u][x] + a[x][v]);
		for (int u = 1; u <= n; u++)
			for (int v = 1; v <= n; v++)
				E1[u][v][1] = std::min(E1[u][v][1], a[u][v]);
	}
	for (int k = 2; k <= 64; k++)
	{
		for (int u = 1; u <= n; u++)
			for (int v = 1; v <= n; v++)
				E1[u][v][k] = E1[u][v][k - 1];
		for (int u = 1; u <= n; u++)
			for (int v = 1; v <= n; v++)
				for (int x = 1; x <= n; x++)
					E1[u][v][k] = std::min(E1[u][v][k], E1[u][x][k - 1] + E1[x][v][1]);
	}
	for (int u = 1; u <= n; u++)
		for (int v = 1; v <= n; v++)
			E2[u][v][1] = E1[u][v][64];
	for (int k = 2; k <= 64; k++)
	{
		for (int u = 1; u <= n; u++)
			for (int v = 1; v <= n; v++)
				E2[u][v][k] = E2[u][v][k - 1];
		for (int u = 1; u <= n; u++)
			for (int v = 1; v <= n; v++)
				for (int x = 1; x <= n; x++)
					E2[u][v][k] = std::min(E2[u][v][k], E2[u][x][k - 1] + E2[x][v][1]);
	}
	for (int u, v, k; q--;)
	{
		scanf("%d%d%d", &u, &v, &k);
		k++;
		long long ans = inf;
		for (int x = 1; x <= n; x++)
			ans = std::min(ans, E1[u][x][k % 64] + E2[x][v][k / 64]);
		printf("%lld\n", ans);
	}
	return 0;
}