#n以下の素数列挙(O(n log(n))
st = set()
def primes(n):
    ass = []
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return is_prime
T = int(input())
p = primes(5*10**6+1)
for _ in range(T):
  A, P = map(int, input().split())
  ans = 1
  if p[P] == False:
    print(-1)
    continue
  if A % P == 0:
    print(0)
  else:
    print(1)