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
#include "bits/stdc++.h"
using namespace std;

struct node {
  short operation;
  long set1;
  long set2;
};

long N;

vector<node> NODES;

bool solve(long setNum, long member) {
    if(setNum <= N) {
        return member % setNum == 0;
    }

    node currentNode = NODES[setNum - N - 1];

    if(currentNode.operation == 1) {
        return solve(currentNode.set1, member) || solve(currentNode.set2, member);
    } else if (currentNode.operation == 2) {
        return solve(currentNode.set1, member) && solve(currentNode.set2, member);
    } else {
        return !solve(currentNode.set1, member);
    }
    
    
}

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

    long m, q;
    long x, v;

    cin >> N >> m >> q;

    short operation;
    long set1, set2;

    for(long i=0; i<m; i++) {
        node currentNode;
        cin >> currentNode.operation >> currentNode.set1;
        if(currentNode.operation != 3) {
            cin >> currentNode.set2;
        }
        NODES.push_back(currentNode);
    }

    for(long i=0; i<q; i++) {
        cin >> x >> v;
        bool result = solve(x, v);
        if(result) {
            cout << "TAK\n";
        } else {
            cout << "NIE\n";
        }
        // cout.flush();
    }

    return 0;

}