import sys
import math

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

def solve():
    input = sys.stdin.read().split()
    S = int(input[0])
    idx = 1
    for _ in range(S):
        X = int(input[idx])
        Y = int(input[idx+1])
        idx += 2
        
        sum_xy = X + Y
        diff_xy = abs(X - Y)
        
        if diff_xy == 0:
            print(0)
            continue
        
        divisors_sum = get_divisors(sum_xy)
        divisors_diff = get_divisors(diff_xy)
        
        count = 0
        
        for s in divisors_sum:
            t_candidate = s - 2
            if t_candidate <= 0:
                continue
            if t_candidate in divisors_diff:
                A = s - 1
                if A < 2:
                    continue
                denominator = A * A - 1
                numerator_b = A * X - Y
                numerator_c = A * Y - X
                if numerator_b <= 0 or numerator_c <= 0:
                    continue
                if numerator_b % denominator != 0 or numerator_c % denominator != 0:
                    continue
                B = numerator_b // denominator
                C = numerator_c // denominator
                if B > 0 and C > 0:
                    count += 1
        
        print(count)

if __name__ == '__main__':
    solve()