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
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r)for(int i=(l);i<=(r);++i)
#define REP(i,n)FOR(i,0,(n)-1)
#define ssize(x)int(x.size())
#ifdef DEBUG
auto operator<<(auto&o,auto x)->decltype(x.end(),o);
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<", "<<get<3>(t)<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

constexpr int N = 5e4;
using B = bitset<N>;

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int n, m, q;
	cin >> n >> m >> q;

	vector<B> v(n + m);
	FOR(i, 1, n) {
		for (int j = i; j <= n; j += i) {
			v[i - 1][j - 1] = 1;
		}
	}
	REP(i, m) {
		const int id = n + i;
		int type, x, y;
		cin >> type;
		if (type == 1) {
			cin >> x >> y;
			--x, --y;
			v[id] = v[x] | v[y];
		}
		else if (type == 2) {
			cin >> x >> y;
			--x, --y;
			v[id] = v[x] & v[y];
		}
		else if (type == 3) {
			cin >> x;
			--x;
			v[id] = ~v[x];
		}
		else {
			assert(false);
		}
	}
	REP(i, q) {
		int x, y;
		cin >> x >> y;
		--x, --y;
		if (v[x][y])
			cout << "TAK\n";
		else
			cout << "NIE\n";
	}
}