1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
import numpy as np
n, m, q = map(int, input().split())
a = []
for i in range(1, n + 1):
    b = []
    for i in range(i, n + 1, i):
        b.append(i)
    a.append(np.array(b))

for i in range(m):
    d = list(map(int, input().split()))
    if d[0] == 1:
        a.append(np.union1d(a[d[1]-1], a[d[2] - 1]))
    elif d[0] == 2:
        a.append(np.intersect1d(a[d[1] - 1],a[d[2] - 1]))
    elif d[0] == 3:
        a.append(np.setdiff1d(a[0],a[d[1] - 1]))

for i in range(q):
    x, v = map(int,input().split())
    if v in a[x-1]:
        print('TAK')
    else:
        print('NIE')