#include <bits/stdc++.h>

using namespace std;

#define rep(it, ff, ee) for (int it = (ff); it <= (ee); ++it)
#define per(it, ff, ee) for (int it = (ff); it >= (ee); --it)
#define SZ(_x_) ((int) _x_.size())
#define all(_x_) (_x_).begin(), (_x_).end()
#define int long long

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
using vi = vector<int>;

const int MAXN = 2e3 + 10;
const int MaxN = 2e3 + 10;
const int INF = 1e9;

#define MUT

struct DSU {
	vector<int> fa, siz, sum, g;
    vector<pair<int, int>> tmp;
	DSU(int n) {
		fa.assign(n + 1, 0);
		siz.assign(n + 1, 1);
		sum.assign(n + 1, 0);
		g.assign(n + 1, 0);
		for (int i = 1; i <= n; i++) {
			fa[i] = i;
			sum[i] = i;
		}
	}
	// int find(int x) {
	// 	if (fa[x] == x) return x;
	// 	auto f = find(fa[x]);
	// 	g[x] += g[fa[x]];
	// 	return fa[x] = f;
	// }
    int find(int x) {
        if (fa[x] == x) return x;
        return find(fa[x]);
    }
	void hebin(int x, int y) {
		x = find(x);
		y = find(y);
		if (x == y) {
            tmp.emplace_back(-1, -1);
            return;
        }
		if (siz[x] < siz[y]) swap(x, y);
        tmp.emplace_back(x, y);
		fa[y] = x;
		siz[x] += siz[y];
		sum[x] += sum[y];
	}
    void undone() { //撤销
        auto [x, y] = tmp.back();
        tmp.pop_back();
        if (x == -1) return;
        fa[y] = y;
        siz[x] -= siz[y];
        sum[x] -= sum[y];
    }
	void move(int x, int y) { // x -> y
		auto fx = find(x), fy = find(y);
		if (fx == fy) return;
		fa[x] = fy;
		--siz[fx], ++siz[fy];
		sum[fx] -= x, sum[fy] += x;
	}
};

int N, L, Q;
int a[MAXN][MAXN], dis[MAXN][MAXN];
vector<pair<int, int>> G1[MaxN];
inline void Solve() {
	cin >> N >> L >> Q;
	DSU dsu(N);
	int NN = N;
	vector<int> ans(Q + 1);
	for (int i = 1; i <= N; i++) {
		G1[i].clear();
	}
	for	(int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			dis[i][j] = INF;
		}
	}
	for (int i = 1; i <= L; i++) {
		string s1;
		cin >> s1;
		for (int j = 0; j < 2 * N; j += 2) {
			a[i][j / 2 + 1] = (s1[j] - '0') * 50 + (s1[j + 1] - '0') % 50;
		}
	}
	

	for (int i = 1; i <= L; i++) {
		map<int, int> mp;
		for (int j = 1; j <= N; j++) {
			mp[a[i][j]]++;
		}
		if (mp.size() == N - 1) {
			int id = 0, maxn = 0;
			for (auto [x, y] : mp) {
				if (y == 2) {
					maxn = x;
				}
			}
			for (int j = 1; j <= N; j++) {
				if (mp[j] == 0) id = j;
			}
			for (int j = 1; j <= N; j++) {
				if (a[i][j] == maxn) {
					auto x = j, y = id;
					G1[x].emplace_back(y, i);
					// cerr << x << ' ';
					// cerr << y << endl;
				}
			}

		} else if (mp.size() == N) {
			for (int j = 1; j <= N; j++) {
				auto x = j, y = a[i][j];
				if (dsu.find(x) != dsu.find(y)) {
					G1[x].emplace_back(y, i);
					G1[y].emplace_back(x, i);
					dsu.hebin(x, y);
				}

				// cerr << x << ' ';
				// cerr << y << endl;
			}
		}
	}

	for (int s = 1; s <= N; s++) {
		priority_queue<pii, vector<pii>, greater<pii> > q;
		q.emplace(0, s);
		vector<int> vis(N + 1);
		dis[s][s] = 0;
		while (!q.empty()) {
			auto [d, x] = q.top(); q.pop();
			if (vis[x]) continue;
			vis[x] = 1;
			for (auto [y, w] : G1[x]) {
				if (max(dis[s][x], w) < dis[s][y]) {
					dis[s][y] = max(dis[s][x], w);
					q.emplace(dis[s][y], y);
				}
			}
		}
	}


	// for (int i = 1; i <= N; i++) {
	// 	for (int j = 1; j <= N; j++) {
	// 		cerr << dis[i][j] << ' ';
	// 	}
	// 	cerr << endl;
	// }

	for (int i = 1; i <= Q; i++) {
		string s1;
		cin >> s1;
		int res[3];
		for (int j = 0; j < 6; j += 2) {
			res[j / 2] = (s1[j] - '0') * 50 + (s1[j + 1] - '0') % 50;
		}
		int x = res[0];
		int y = res[1];
		int z = res[2];
		int ans = dis[x][y];
		// cerr << ans << endl;
		cout << (ans <= z);
		
	}
	cout << endl;

}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
#ifdef MUT
	int T;
	cin >> T;
	while (T--)
#endif
		Solve();	
	return 0;
}