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
55
56
57
#include <iostream>
#include <bitset>
#include <vector>


using namespace std;


int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    vector<bitset<50001>> tab(450000 + 7);

    //bitset<50001> tab[450000 + 7];



    int n, m, q;
    cin >> n >> m >> q;



    for (int i = 1; i <= n; i++){
        for (int j = i; j <= n; j += i ){
            tab[i].flip(j);
        }
    }

    int op, a, b;

    for (int i = n + 1; i <= n + m; i++){
        cin >> op;
        
        if (op == 1){
            cin >> a >> b;
            tab[i] = tab[a] | tab[b];
        }
        else if (op == 2){
            cin >> a >> b;
            tab[i] = tab[a] & tab[b];
        }
        else{
            cin >> a;
            tab[i] = tab[a];
            tab[i].flip();
        }
    }

    while (q--){
        cin >> a >> b;
        cout << (tab[a][b] ? "TAK\n" : "NIE\n");
    }


    return 0;
}