import math
limit = 5*10**6
distinct_prime_factor_count = [0]*(limit+1)
primes = []
for i in range(2, limit+1):
    if distinct_prime_factor_count[i] == 0:
        primes.append(i)
        for num in range(i, limit+1, i):
            distinct_prime_factor_count[num] += 1

primes_set = set(primes)

T = int(input())

for i in range(T):
    A, P = map(int, input().split())
    if P not in primes_set: # 素数でないなら、
        print(-1)
        continue

    # フェルマーの小定理が使えるかどうか
    if math.gcd(A, P) == 1:
        # a**(p-1) = 1 (mod p) のため、1
        print(1)
    else:
        print(0)