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
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) X.begin(), X.end()
#define sz(X) int(size(X))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
using pii = pair<int, int>; using vi = vector<int>;
using ll = long long; using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) { *(int *)0 = 0; });
#define DTP(x, y) auto operator<<(auto &o, auto a) -> decltype(y, o) { o << "("; x; return o << ")"; }
auto operator<<(auto &o, auto a) -> decltype(all(a), o);
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
#define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", [](auto... arg_) { (( cerr << arg_ << ", " ), ...) << '\n'; }(x)
#else
#define deb(...) 0
#endif

const int K = 128;
using bs = bitset<K>;

void solve() {
    int n, m, q;
    cin >> n >> m >> q;
    vector<array<int, 3>> ops(n+m+1);
    for (int i = n+1; i <= n+m; ++i) {
        auto &[x, y, z] = ops[i];
        cin >> x >> y;
        if (x != 3) cin >> z;
    }

    vi ansy(q, -1);
    vector<vector<pii>> perv(n+1);
    rep(id, q) {
        int ax, v;
        cin >> ax >> v;
        perv[v].eb(ax, id);
    }

    vi nex(n+1);
    iota(all(nex), 0);

    vector<bs> seciki;

    for (int l = 0; l <= n; l += K) {
        seciki.assign(n+m+1, bs());

        for (int id = 1; id <= n; ++id) {
            while (nex[id] - l < K) {
                seciki[id][nex[id] - l] = true;
                nex[id] += id;
            }
        }
        for (int id = n+1; id <= n+m; ++id) {
            auto [x, y, z] = ops[id];
            if (x == 1)
                seciki[id] = seciki[y] | seciki[z];
            if (x == 2)
                seciki[id] = seciki[y] & seciki[z];
            if (x == 3)
                seciki[id] = ~seciki[y];
        }
        for (int v = l; v <= n && v < l + K; ++v) {
            for (auto [ax, qid] : perv[v]) {
                ansy[qid] = seciki[ax][v - l];
            }
        }
    }

    for (int i : ansy) {
        cout << (i ? "TAK\n" : "NIE\n");
    }
}

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(10);

    int z = 1;
    // cin >> z;
    rep(_, z) solve();

    cout << flush;
    _Exit(0);
}