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
#ifndef LOCAL
#pragma GCC optimize("O3", "unroll-loops")
#endif
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p); i<=(k); ++i)
#define REP(i,k) FOR(i,0,(k)-1)
#define RFOR(i,p,n) for(int i=(p); i>=(n); --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ssize(x) int((x).size())
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define C const
#define pn printf("\n")
using namespace std;
typedef long long ll;
typedef V <int> vi;
typedef V <ll> vll;
typedef C int ci;
typedef C ll cll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
void chmin(auto &a, auto b){a=min(a,b);}
void chmax(auto &a, auto b){a=max(a,b);}
ci inf=2.1e9;
cll infll=4.5e18;
int I(){
    int z;
    scanf("%d", &z);
    //cin>>z;
    return z;
}
void ans(){
    ci cap=5e4;
    typedef bitset <cap+1> bs;
    ci n=I(),m=I(),q=I();
    V <bs> t(n+m+1);
    FOR(i, 1, n){
        for (int j=i; j<=n; j+=i)
            t[i].set(j);
    }
    FOR(i, n+1, m+n){
        ci z=I(),p=I(),k=z<3 ? I() : -1;
        if (z==3)
            t[i]=~t[p];
        if (z==2)
            t[i]=t[p]&t[k];
        if (z==1)
            t[i]=t[p]|t[k];
    }
    REP(_, q){
        ci x=I(),v=I();
        printf(t[x].test(v) ? "TAK\n" : "NIE\n");
    }
}
int main(){
    //ios_base::sync_with_stdio(0),cin.tie(0);
    int tt=1;
    //tt=I();
    while (tt--)ans();
}