import sys
input = sys.stdin.buffer.readline

import math

def sieve(n):
    ass = []
    is_prime = [True]*(n+1)
    is_prime[0] = False
    is_prime[1] = False

    for i in range(2, int(math.sqrt(n))+1):
        if not is_prime[i]:
            continue
        for j in range(i*2, n+1, i):
            is_prime[j] = False
    for i in range(n+1):
        if is_prime[i]:
            ass.append(i)
    return(ass)

S = sieve(5*10**6)
S = set(S)

t = int(input())
for _ in range(t):
    a, p = map(int, input().split())
    if p in S:
        if a%p != 0:
            print(1)
        else:
            print(0)
    else:
        print(-1)