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

constexpr int MAX_N = 5e4;

int n, m, q;
int skibidi, x, y, v;

vector<bitset<MAX_N>> zbiory;

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

    cin >> n >> m >> q;

    for(int i = 1; i <= n; i++) {
        zbiory.push_back(bitset<MAX_N>());

        for(int j = i; j <= n; j += i) {
            zbiory.back()[j - 1] = 1;
        }
    }

    for(int i = 1; i <= m; i++) {
        cin >> skibidi;

        if(skibidi == 1) {
            cin >> x >> y;
            zbiory.push_back(zbiory[x - 1] | zbiory[y - 1]);
        }
        else if(skibidi == 2) {
            cin >> x >> y;
            zbiory.push_back(zbiory[x - 1] & zbiory[y - 1]);
        }
        else {
            cin >> x;
            zbiory.push_back(~zbiory[x - 1]);
        }
    }

    for(int i = 1; i <= q; i++) {
        cin >> x >> v;
        cout << (zbiory[x - 1][v - 1] ? "TAK" : "NIE") << '\n';
    }
}