import sys
import math

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

def solve():
    input = sys.stdin.read().split()
    idx = 0
    S = int(input[idx])
    idx += 1
    for _ in range(S):
        X = int(input[idx])
        Y = int(input[idx + 1])
        idx += 2
        S_total = X + Y
        D = abs(X - Y)
        divisors = get_divisors(S_total)
        count = 0
        for d in divisors:
            if d < 3:
                continue
            temp = d - 2
            if D != 0:
                if temp == 0 or D % temp != 0:
                    continue
            A = d - 1
            denominator = (d - 2) * d
            numeratorB = A * X - Y
            if numeratorB <= 0:
                continue
            if numeratorB % denominator != 0:
                continue
            B = numeratorB // denominator
            numeratorC = A * Y - X
            if numeratorC <= 0:
                continue
            if numeratorC % denominator != 0:
                continue
            C = numeratorC // denominator
            if B > 0 and C > 0:
                count += 1
        print(count)

if __name__ == "__main__":
    solve()