import sys
input = sys.stdin.readline
def primes(n):
    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 [i for i in range(n + 1) if is_prime[i]]
L=primes(5000000)
T=int(input())
for i in range(T):
    A,P=map(int,input().split())
    if P not in L:
        print(-1)
    else:
        if A%P==0:
            print(0)
        else:
            print(1)