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
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#include <iostream>
#include <vector>
#include <cstdint>

using namespace std;

const int MAX_NODES = 500005;
const int WORDS = 64;

struct Operation {
    int type;
    int x;
    int y;
};

Operation ops[MAX_NODES];
uint64_t bit_states[MAX_NODES][WORDS];
vector<int> divisors_of[50005];

struct Query {
    int x;
    int v;
    int id;
};

bool answers[1000005];

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

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

    for (int i = 1; i <= m; ++i) {
        cin >> ops[i].type >> ops[i].x;
        if (ops[i].type == 1 || ops[i].type == 2) {
            cin >> ops[i].y;
        }
    }

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

    vector<Query> queries(q);
    for (int i = 0; i < q; ++i) {
        cin >> queries[i].x >> queries[i].v;
        queries[i].id = i;
    }

    int num_queries_processed = 0;

    while (num_queries_processed < q) {
        int current_batch_size = min(q - num_queries_processed, WORDS * 64);

        for (int i = 1; i <= n; ++i) {
            for (int w = 0; w < WORDS; ++w) {
                bit_states[i][w] = 0;
            }
        }

        for (int k = 0; k < current_batch_size; ++k) {
            int q_idx = num_queries_processed + k;
            int v = queries[q_idx].v;
            
            int word_idx = k >> 6;
            uint64_t bit_mask = 1ULL << (k & 63);

            for (int divisor : divisors_of[v]) {
                bit_states[divisor][word_idx] |= bit_mask;
            }
        }

        for (int i = 1; i <= m; ++i) {
            int target = n + i;
            int type = ops[i].type;
            int x = ops[i].x;
            
            if (type == 1) {
                int y = ops[i].y;
                for (int w = 0; w < WORDS; ++w) {
                    bit_states[target][w] = bit_states[x][w] | bit_states[y][w];
                }
            } else if (type == 2) {
                int y = ops[i].y;
                for (int w = 0; w < WORDS; ++w) {
                    bit_states[target][w] = bit_states[x][w] & bit_states[y][w];
                }
            } else if (type == 3) {
                for (int w = 0; w < WORDS; ++w) {
                    bit_states[target][w] = ~bit_states[x][w];
                }
            }
        }

        for (int k = 0; k < current_batch_size; ++k) {
            int q_idx = num_queries_processed + k;
            int target_set = queries[q_idx].x;
            
            int word_idx = k >> 6;
            uint64_t bit_mask = 1ULL << (k & 63);

            answers[queries[q_idx].id] = (bit_states[target_set][word_idx] & bit_mask) != 0;
        }

        num_queries_processed += current_batch_size;
    }

    for (int i = 0; i < q; ++i) {
        if (answers[i]) {
            cout << "TAK\n";
        } else {
            cout << "NIE\n";
        }
    }

    return 0;
}