n, m, q = map(int, input().split())
U = {i for i in range(1, n+1)}
A = [frozenset(i for i in range(1, n+1) if i%j==0) for j in range(1, n+1)]
for i in range(m):
inp = input().split()
if len(inp) == 2:
op, s1 = map(int, inp)
A.append(U - A[s1-1])
else:
op, s1, s2 = map(int, inp)
A.append(A[s1-1] | A[s2-1]) if op == 1 else A.append(A[s1-1] & A[s2-1])
for i in range(q):
x, v = map(int, input().split())
print("TAK" if v in A[x-1] else "NIE")
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 | n, m, q = map(int, input().split()) U = {i for i in range(1, n+1)} A = [frozenset(i for i in range(1, n+1) if i%j==0) for j in range(1, n+1)] for i in range(m): inp = input().split() if len(inp) == 2: op, s1 = map(int, inp) A.append(U - A[s1-1]) else: op, s1, s2 = map(int, inp) A.append(A[s1-1] | A[s2-1]) if op == 1 else A.append(A[s1-1] & A[s2-1]) for i in range(q): x, v = map(int, input().split()) print("TAK" if v in A[x-1] else "NIE") |
English