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
113
114
115
116
117
118
119
120
121
122
123
124
#include <iostream>
#include <map>

using namespace std;

unsigned long long N = 4000009;

unsigned long long n, m, q;

unsigned long long o[4000009], z1[4000009], z2[4000009];
// int r[50009][400009];
map <unsigned long long, int> r;

long long x, v;

bool check(long long vv, long long xx)
{
    bool result;
    unsigned long long tmp;

    if (r[vv * N + xx] == 1)
    {
        return true;
    }
    else if(r[vv * N + xx] == 2)
    {
        return false;
    }
    
    if(xx <= n)
    {
        return vv % xx == 0;
    }
    else
    {
        tmp = xx-n-1;
        
        if(o[tmp] == 1)
        {
            result = check(vv, z1[tmp]) || check(vv, z2[tmp]);

            if (result)
            {
                r[vv * N + xx] = 1;
            }
            else
            {
                r[vv * N + xx] = 2;
            }
            
            return result;
        }
        else if(o[tmp] == 2)
        {
            result = check(vv, z1[tmp]) && check(vv, z2[tmp]);

            if (result)
            {
                r[vv * N + xx] = 1;
            }
            else
            {
                r[vv * N + xx] = 2;
            }

            return result;
        }
        else if(o[tmp] == 3)
        {
            result = !check(vv, z1[tmp]);

            if (result)
            {
                r[vv * N + xx] = 1;
            }
            else
            {
                r[vv * N + xx] = 2;
            }

            return result;
        }

    }
    return false;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    cin >> n >> m >> q;

    for(int i=0; i<m; i++)
    {
        cin >> o[i];

        if(o[i] < 3)
        {
            cin >> z1[i] >> z2[i];
        }
        else
        {
            cin >> z1[i];
        }
    }

    for(int i=0; i<q; i++)
    {
        cin >> x >> v;

        if(check(v, x))
        {
            cout << "TAK" << '\n';
        }
        else
        {
            cout << "NIE" << '\n';
        }
    }

    return 0;
}