1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
n, m, q = [int(x) for x in input().split(" ")]

all_sets = [set([i for i in range(1, n + 1)
                 if i % j == 0]) for j in range(1, n + 1)]

for _ in range(m):
    r = [int(x) for x in input().split(" ")]
    if r[0] == 1:
        all_sets.append(all_sets[r[1] - 1].union(all_sets[r[2] - 1]))
    elif r[0] == 2:
        all_sets.append(all_sets[r[1] - 1].intersection(all_sets[r[2] - 1]))
    elif r[0] == 3:
        all_sets.append(all_sets[0].difference(all_sets[r[1] - 1]))

for _ in range(q):
    x, v = [int(x) for x in input().split(" ")]
    if v in all_sets[x - 1]:
        print("TAK")
    else:
        print("NIE")