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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
//mt19937 mrand(random_device{}());
const ll mod=1000000007;
//int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
int gcd(int a,int b) { return b?gcd(b,a%b):a;}
// head

const int N=5e4+5,M=4e5+5,Q=1e6+5;

#define INF 0x3f3f3f3f

template<class T> inline void read(T &x) {
    x=0; int c=getchar(),f=1;
    for (;!isdigit(c);c=getchar()) if (c==45) f=-1;
    for (;isdigit(c);c=getchar()) (x*=10)+=f*(c-'0');
}

struct op {
    char type;
    int x,y;
};

struct query {
    int x,b_idx,i;
};

VI divs[N];
op ops[M];
vector<query> qs[N/64+5];
uint64_t mask[N+M];
bool ans[Q];

int main() {
    int n,m,q;
    scanf("%d%d%d",&n,&m,&q);
    rep(i,1,n+1) for (int j=i;j<=n;j+=i) divs[j].pb(i);
    rep(i,0,m) {
        char type;
        int x,y;
        scanf(" %c",&type);
        scanf("%d",&x);
        if (type!='3') scanf("%d",&y);
        ops[i]={type,x,y};
    }
    rep(i,0,q) {
        int x,v;
        scanf("%d%d",&x,&v);
        v--;
        qs[v/64].pb({x,v%64,i});
    }
    int total_buckets=(n-1)/64+1;
    rep(b,0,total_buckets) {
        if (qs[b].empty()) continue;
        memset(mask,0,sizeof(uint64_t)*(n+m+1));
        rep(b_idx,0,64) {
            int v=b*64+b_idx+1;
            if (v>n) break;
            for (auto d:divs[v]) mask[d]|=(1ULL<<b_idx);
        }
        rep(i,0,m) {
            auto[type,x,y]=ops[i];
            if (type=='1') mask[n+i+1]=mask[x]|mask[y];
            else if (type=='2') mask[n+i+1]=mask[x]&mask[y];
            else if (type=='3') mask[n+i+1]=~mask[x];
        }
        for (const auto &[x,b_idx,i]:qs[b]) ans[i]=(mask[x]>>b_idx)&1;
    }
    rep(i,0,q) {
        if (ans[i]) puts("TAK");
        else puts("NIE");
    }
}