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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
#include <iostream>
#include <stack>
using namespace std;
int main()
{
    int n,m,q,a,b,c,d;
    cin>>n>>m>>q;
    stack <int> stos[n+m],zapas[3];
    for (int i=0;i<n;i++)
    {
        a=i+1;
        for(int f=a;f<n+1;f++)
           {

           if(f%a==0)
        {
            stos[i].push(f);
        }
           }
    }
    for(int i=0;i<m;i++)
    {
        cin>>b;
        if(b!=3)
        {
            cin>>c>>d;
            if(c==d)
            {
                while(!stos[c-1].empty())
                {
                    zapas[0].push(stos[c-1].top());
                    stos[c-1].pop();
                }
                while(!zapas[0].empty())
                {
                    stos[n+i].push(zapas[0].top());
                    stos[c-1].push(zapas[0].top());
                    zapas[0].pop();
                }
            }
            else{
            while(!stos[c-1].empty()&&!stos[d-1].empty())
            {
                if(stos[c-1].top()>stos[d-1].top())
                {
                    zapas[0].push(stos[c-1].top());
                    if(b==1){
                            zapas[2].push(stos[c-1].top());
                    }
                    stos[c-1].pop();
                }
                else if(stos[c-1].top()<stos[d-1].top())
                {
                    zapas[1].push(stos[d-1].top());
                    if(b==1){
                            zapas[2].push(stos[d-1].top());
                    }
                    stos[d-1].pop();
                }
                else if(stos[c-1].top()==stos[d-1].top())
                {
                    zapas[0].push(stos[c-1].top());
                    zapas[2].push(stos[d-1].top());
                    zapas[1].push(stos[c-1].top());
                    stos[d-1].pop();
                    stos[c-1].pop();
                }
            }
            while(!stos[c-1].empty()||!stos[d-1].empty())
            {
                if(stos[c-1].empty())
                {
                    zapas[1].push(stos[d-1].top());
                    if(b==1){
                            zapas[2].push(stos[d-1].top());
                            }
                    stos[d-1].pop();
                }
                else if(stos[d-1].empty())
                {
                    zapas[0].push(stos[c-1].top());
                    if(b==1){
                            zapas[2].push(stos[c-1].top());
                    }
                    stos[c-1].pop();
                }
            }
                while(!zapas[2].empty())
                {
                    stos[n+i].push(zapas[2].top());
                    zapas[2].pop();
                }
                while(!zapas[0].empty())
                {
                    stos[c-1].push(zapas[0].top());
                    zapas[0].pop();
                }
                while(!zapas[1].empty())
                {
                    stos[d-1].push(zapas[1].top());
                    zapas[1].pop();
                }
            }
        }
        else
        {
            cin>>c;
            while(!stos[c-1].empty())
            {
                zapas[0].push(stos[c-1].top());
                stos[c-1].pop();
            }
            for(int f=1;f<n+1;f++)
            {
                if(zapas[0].empty())
                {
                    stos[n+i].push(f);
                }
                else if(f!=zapas[0].top())
                {
                    stos[n+i].push(f);
                }
                else
                {
                    zapas[0].pop();
                }
            }
        }
    }
    for(int i=0;i<q;i++)
    {
        cin>>b>>c;
        d=0;
        while(!stos[b-1].empty())
        {
            if(c==stos[b-1].top())
            {
                d=1;
            }
            zapas[0].push(stos[b-1].top());
            stos[b-1].pop();
        }
        if(d==0)
        {
            cout<<"NIE"<<endl;
        }
        else{ cout<<"TAK"<<endl;}
        while(!zapas[0].empty())
        {
            stos[b-1].push(zapas[0].top());
            zapas[0].pop();
        }
    }
    return 0;
}