1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <bits/stdc++.h>
using namespace std;
#define rep(a, b) for (int a = 0; a < (b); a++)
#define rep1(a, b) for (int a = 1; a <= (b); a++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;

#define LOCAL false

const int MAXN = 5e4 + 7;
const int MAXM = 4e5 + 7;
int n, m, q;

vector<bitset<MAXN>> sets;


int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (LOCAL) {
        ignore=freopen("io/in", "r", stdin);
        ignore=freopen("io/out", "w", stdout);
    }

    
    cin >> n >> m >> q;

    sets = vector<bitset<MAXN>>(MAXN+MAXM);
    rep1(i, n) for (int x = i; x <= n; x += i) sets[i][x] = true;

    int mode, x, y;
    rep1(i, m) {
        cin >> mode;
        if (mode == 1) {
            cin >> x >> y;
            sets[n+i] = sets[x]|sets[y];
        } else if (mode == 2) {
            cin >> x >> y;
            sets[n+i] = sets[x]&sets[y];
        } else {
            cin >> x;
            sets[n+i] = ~sets[x];
        }
    }

    rep(i, q) {
        cin >> x >> y;
        cout << (sets[x][y] ? "TAK" : "NIE") << "\n";
    }

    return 0;
}