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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include <bits/stdc++.h>

int n, m, q;

const int N = 50004;
const int M = 400005;
const int Q = 1000006;

std::vector<std::bitset<N>> A;

void read_data() {
    std::cin >> n >> m >> q;
    A.resize(n + m + 1);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; i * j <= n; ++j) {
            A[i].set(i * j);
        }
    }
}

inline void set_or(int idx, int x, int y) {
    A[idx] = A[x] | A[y];
}

inline void set_and(int idx, int x, int y) {
    A[idx] = A[x] & A[y];
}

inline void set_neg(int idx, int x) {
    A[idx] = ~A[x];
}

void generate_data() {
    int op, x, y;
    for (int idx = n + 1; idx <= n + m; ++idx) {
        std::cin >> op;
        switch (op) {
            case 1:
                std::cin >> x >> y;
                set_or(idx, x, y);
                break;
            case 2:
                std::cin >> x >> y;
                set_and(idx, x, y);
                break;
            case 3:
                std::cin >> x;
                set_neg(idx, x);
                break;
        }
    }
}

void process_queries() {
    int x, y;
    for (int i = 0; i < q; ++i) {
        std::cin >> x >> y;
        if (A[x].test(y)) {
            std::cout << "TAK\n";
        } 
        else {
            std::cout << "NIE\n";
        }
    }
}

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

    read_data();
    generate_data();
    process_queries();

    return 0;
}