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

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 1000010;

struct node {
  int op, x, y;
} a[maxn];

int n, m, q, ans[maxn];
ull s[maxn];
vector<tuple<int, int, int>> que[maxn];

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> m >> q;
  rep (i, 1, m) {
    cin >> a[i].op >> a[i].x;
    if (a[i].op != 3) cin >> a[i].y;
  }
  rep (i, 1, q) {
    int x, v;
    cin >> x >> v;
    que[v >> 6].emplace_back(v & 63, x, i);
  }
  for (int l = 0, r; l <= n; l += 64) {
    r = l + 63;
    rep (i, 1, n) {
      s[i] = 0;
      int dl = (l + i - 1) / i * i, dr = r / i * i;
      for (int x = dl; x <= dr; x += i) s[i] |= (1ull << (x - l));
    }
    rep (i, 1, m) {
      if (a[i].op == 1) s[n + i] = s[a[i].x] | s[a[i].y];
      else if (a[i].op == 2) s[n + i] = s[a[i].x] & s[a[i].y];
      else s[n + i] = (-1ull) ^ s[a[i].x];
    }
    for (auto [c, x, id] : que[l >> 6]) ans[id] = (s[x] >> c & 1);
  }
  rep (i, 1, q) cout << (ans[i] ? "TAK" : "NIE") << '\n';
}