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
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<queue>
#include<stack>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<VLL > VVLL;
typedef vector<VLD > VVLD;
typedef vector<PII > VPII;
typedef __int128 int128;
template<class TIn>
using indexed_set = tree<
        TIn, null_type, less<TIn>,
        rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define THIS (*this)
#define LSB(x) (x & -x)
#define SQR(x) ((x)*(x))

const int BASE = 64;

struct bmask {
    vector<unsigned long long> b;
    
    bmask(int n = 0): b(n) {}
    int size() { return b.size(); }
    void set(int x) { int i = x / BASE; b[i] |= (1LL << (x % BASE)); }
    bool isSet(int x) { int i = x / BASE; return b[i] & (1LL << (x % BASE)); }
};

bmask neg(bmask &a) {
    bmask res(a.size());
    REP(i, a.size()) res.b[i] = ~a.b[i];
    return res;
}

bmask band(bmask &a, bmask &b) {
    bmask res(a.size());
    REP(i, a.size()) res.b[i] = a.b[i] & b.b[i];
    return res;
}

bmask bor(bmask &a, bmask &b) {
    bmask res(a.size());
    REP(i, a.size()) res.b[i] = a.b[i] | b.b[i];
    return res;
}

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    int n, m, q;
    cin >> n >> m >> q;
    vector<bmask> bm(n + m + 1);
    int bmsize = (n + BASE) / BASE;
    FOR(i, 1, n) {
        bm[i].b.assign(bmsize, 0);
        int x = i;
        while (x <= n) {
            bm[i].set(x);
            x += i;
        }
    }
    REP(i, m) {
        int t; cin >> t;
        if (t == 3) {
            int x; cin >> x;
            bm[n + 1 + i] = neg(bm[x]);
        } else {
            int x, y; cin >> x >> y;
            bm[n + 1 + i] = (t == 1 ? bor(bm[x], bm[y]) : band(bm[x], bm[y]));
        }
    }
    REP(i, q) {
        int x, v;
        cin >> x >> v;
        if (v <= n && bm[x].isSet(v)) cout << "TAK\n";
        else cout << "NIE\n";
    }

    return 0;
}