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>

using namespace std;

const int NMAX = 50007, MMAX = 400007;

struct A{
    int type;
    int x;
    int y;
    void set(int a, int b, int c){
        type = a;
        x = b;
        y = c;
    }
    bool isIn(int a, A arr[NMAX+MMAX]){
        if(type == 0){
            return a%x == 0;
        }
        if(type == 1){
            return arr[x].isIn(a, arr) || arr[y].isIn(a, arr);
        }
        if(type == 2){
            return arr[x].isIn(a, arr) && arr[y].isIn(a, arr);
        }
        return !arr[x].isIn(a, arr);
    }
};

A arr[NMAX+MMAX];

int main(){
    ios_base::sync_with_stdio(0);
    int n, m, q;

    cin>>n>>m>>q;

    for(int i=1;i<=n;i++){
        arr[i].set(0, i, 0);
    }
    for(int i=n+1;i<=n+m;i++){
        int mode, x, y = 0;
        cin>>mode>>x;
        if(mode != 3){
            cin>>y;
        }
        arr[i].set(mode, x, y);
    }

    for(int i=0;i<q;i++){
        int x, v;
        cin>>x>>v;
        cout<<(arr[x].isIn(v, arr) ? "TAK\n" : "NIE\n");
    }

    return 0;
}