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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

const int N = 50050;
using B = bitset<N>;
int n, m, q;
vector<B> v;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m >> q;
  v.resize(n + m);
  rep(i, 0, n) {
    for (int j = i + 1; j <= n; j += i + 1) v[i][j] = 1;
  }
  rep(i, 0, m) {
    int t;
    cin >> t;
    if (t == 1) {
      int x, y;
      cin >> x >> y;
      x--; y--;
      v[n + i] = v[x] | v[y];
    } else if (t == 2) {
      int x, y;
      cin >> x >> y;
      x--; y--;
      v[n + i] = v[x] & v[y];
    } else {
      int x;
      cin >> x;
      x--;
      v[n + i] = ~v[x];
    }
  }
  rep(i, 0, q) {
    int x, y;
    cin >> x >> y;
    cout << (v[x - 1][y] ? "TAK" : "NIE") << '\n';
  }
}