#include <bits/stdc++.h>
#define int long long

using namespace std;

inline int read () {
    int w = 1, s = 0; char ch = getchar ();
    for (; ! isdigit (ch); ch = getchar ()) if (ch == '-') w = -1;
    for (; isdigit (ch); ch = getchar ()) s = (s << 1) + (s << 3) + (ch ^ 48);
    return s * w;
}

constexpr int N = 2000;

void solve () {
    int n, l, q;
    cin >> n >> l >> q;

    vector <vector <pair <int, int>>> edge (l);
    for (int i = 0; i < l; i ++) {
        string s;
        cin >> s;

        vector <int> t (n);
        for (int j = 0; j < 2 * n; j += 2) {
            t[j / 2] = (s[j] - 48) * 50 + (s[j + 1] - 48) - 1;
        }

        int sum2 = 0;
        bool ok = true;
        vector <int> cnt (n);
        for (int j = 0; j < n; j ++) {
            cnt[t[j]] ++;
            if (cnt[t[j]] > 2) {
                ok = false;
            } else if (cnt[t[j]] == 2) {
                sum2 ++;
            }
        }

        if (sum2 > 1 || !ok) {
            continue;
        }

        int zero = 0;
        for (int j = 0; j < n; j ++) {
            if (cnt[j] == 0) {
                zero = j;
                break;
            }
        }
        if (sum2) {
            for (int j = 0; j < n; j ++) {
                if (cnt[t[j]] == 2) {
                    edge[i].push_back ({j, zero});
                }
            }
        } else {
            for (int j = 0; j < n; j ++) {
                edge[i].push_back ({j, t[j]});
            }
        }
    }

    vector <vector <array <int, 3>>> qry (l);

    vector <int> ans (q);
    for (int i = 0; i < q; i ++) {
        string s;
        cin >> s;

        array <int, 3> arr;
        for (int j = 0; j < 6; j += 2) {
            arr[j / 2] = (s[j] - 48) * 50 + (s[j + 1] - 48) - 1;
        }

        auto [a, b, c] = arr;
        if (c >= 0) {
            qry[c].push_back ({a, b, i});
        } else {
            if (a == b) {
                ans[i] = 1;
            }
        }
    }

    vector <vector <int>> e (n);

    for (int c = 0; c < l; c ++) {
        for (auto [x, y] : edge[c]) {
            e[x].push_back (y);
        }

        int ts = 0, cnt = 0;
        vector <int> stk;
        vector <int> dfn (n, -1), low (n, -1), id (n, -1);
        
        auto tarjan = [&] (auto &&self, int x) -> void {
            dfn[x] = low[x] = ++ ts;
            stk.push_back (x);
            for (auto y : e[x]) {
                if (dfn[y] == -1) {
                    self (self, y);
                    low[x] = min (low[x], low[y]);
                } else if (id[y] == -1) {
                    low[x] = min (low[x], dfn[y]);
                }
            }
            if (low[x] == dfn[x]) {
                int y;
                do {
                    y = stk.back ();
                    stk.pop_back ();
                    id[y] = cnt;
                } while (y != x);
                cnt ++;
            }
        };
        for (int i = 0; i < n; i ++) {
            if (dfn[i] == -1) {
                tarjan (tarjan, i);
            }
        }
        set <pair <int, int>> ok;
        vector <vector <int>> adj (cnt);
        for (int x = 0; x < n; x ++) {
            for (auto y : e[x]) {
                if (id[x] != id[y]) {
                    if (ok.find ({id[x], id[y]}) == ok.end ()) {
                        ok.insert ({id[x], id[y]});
                        adj[id[x]].push_back (id[y]);
                    }
                }
            }
        }

        vector <bitset <N>> bit (cnt);
        for (int i = 0; i < cnt; i ++) {
            bit[i][i] = 1;
        }
        for (int x = cnt - 1; x >= 0; x --) {
            for (auto y : adj[x]) {
                bit[x] |= bit[y];
            }
        }

        for (auto [a, b, i] : qry[c]) {
            if (bit[id[a]][id[b]]) {
                ans[i] = 1;
            }
        }
    }

    for (auto x : ans) {
        cout << x;
    }
    cout << '\n';
} 

signed main () {
	ios::sync_with_stdio (false);
    cin.tie (nullptr);
    
	int T = 1; 
	cin >> T;
	// T = read ();

	while (T --) {
		solve ();
	}
	
	return 0;
}