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
#include <iostream>
#include <vector>

using Set = std::vector<int>;

bool is_in(int v, int x, int n, Set *sets) {
    if (v > n) {
        return false;
    }
    if (x <= n) {
        return v % x == 0;
    }
    x = x - n - 1;
    for (int i = 0; i < sets[x].size(); i++) {
        if (sets[x][i] == v) {
            return true;
        }
    }
    return false;
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);
    int n, m, q;
    std::cin >> n >> m >> q;
    Set sets[m];
    int type, arg1, arg2;
    for (int i = 0; i < m; i++) {
        std::cin >> type >> arg1;
        if (type < 3) {
            std::cin >> arg2;
            if (type == 1) {
                for (int j = 1; j <= n; j++) {
                    if (is_in(j, arg1, n, sets) || is_in(j, arg2, n, sets)) {
                        sets[i].push_back(j);
                    }
                }
            } else {
                for (int j = 1; j <= n; j++) {
                    if (is_in(j, arg1, n, sets) && is_in(j, arg2, n, sets)) {
                        sets[i].push_back(j);
                    }
                }
            }
        } else {
            for (int j = 1; j <= n; j++) {
                if (!is_in(j, arg1, n, sets)) {
                    sets[i].push_back(j);
                }
            }
        }
    }
    /*for (auto &iter: sets) {
        for (auto iter2: iter) {
            std::cout << iter2 << " ";
        }
        std::cout << "\n";
    }*/
    int v, x;
    for (int i = 0; i < q; i++) {
        std::cin >> x >> v;
        if (is_in(v, x, n, sets)) {
            std::cout << "TAK\n";
        } else {
            std::cout << "NIE\n";
        }
    }
    return 0;
}