import math

def get_divisors(n):
    if n == 0:
        return []
    divisors = set()
    for i in range(1, int(math.isqrt(abs(n))) + 1):
        if abs(n) % i == 0:
            divisors.add(i)
            divisors.add(abs(n) // i)
    return sorted(divisors)

def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    S = int(input[idx])
    idx += 1
    results = []
    for _ in range(S):
        X = int(input[idx])
        Y = int(input[idx + 1])
        idx += 2
        D = X - Y
        S_total = X + Y
        count = 0
        if D == 0:
            n = 2 * X
            divisors = get_divisors(n)
            for d_prime in divisors:
                if d_prime > X:
                    continue
                if X % d_prime != 0:
                    continue
                if d_prime < 2:
                    continue
                A = d_prime - 1
                B = X // d_prime
                C = X // d_prime
                if B <= 0 or C <= 0:
                    continue
                count += 1
        else:
            abs_D = abs(D)
            divisors = get_divisors(abs_D)
            for d in divisors:
                d_prime = d + 2
                if d_prime == 0:
                    continue
                if S_total % d_prime != 0:
                    continue
                A_candidate = d + 1
                if A_candidate < 2:
                    continue
                numerator = A_candidate * X - Y
                denominator = A_candidate ** 2 - 1
                if denominator == 0:
                    continue
                if numerator % denominator != 0:
                    continue
                B = numerator // denominator
                if B <= 0:
                    continue
                C = X - A_candidate * B
                if C <= 0:
                    continue
                count += 1
        results.append(count)
    sys.stdout.write('\n'.join(map(str, results)) + '\n')

if __name__ == "__main__":
    main()