package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	eras := make([]int, 100000)
	usa := make([]int, 0)
	for i := 2; i < 100000; i++ {
		if eras[i] == 0 {
			usa = append(usa, i)
			for j := i; j < 100000; j += i {
				eras[j] = i
			}
		}
	}
	var testcase func()
	testcase = func() {
		var ans int64
		x := getNextInt(scanner)
		y := getNextInt(scanner)
		if x < y {
			x, y = y, x
		}
		p := x + y
		m := x - y
		dd := make([]int, 0)
		dd = append(dd, 1)
		for i := 0; i < len(usa); i++ {
			pp := p
			for pp > 1 && pp%usa[i] == 0 {
				ddd := make([]int, 0)
				for _, d := range dd {
					ddd = append(ddd, d*usa[i])
				}
				for _, d := range ddd {
					dd = append(dd, d)
				}
				pp /= usa[i]
			}
		}
		sort.Ints(dd)
		for i := 0; i < len(dd); i++ {
			if i > 0 && dd[i] == dd[i-1] {
				continue
			}
			ans += calc(p, m, dd[i])
		}
		fmt.Fprintln(writer, ans)
	}
	s := getNextInt(scanner)
	for s > 0 {
		testcase()
		s--
	}
}

func calc(p, m, a int) int64 {
	if a == 1 {
		return 0
	}
	if a == 2 {
		if m == 0 {
			return int64(p/a) - 1
		}
		return 0
	}
	bpc := p / a
	if m%(a-2) != 0 {
		return 0
	}
	bmc := m / (a - 2)
	b2 := bpc + bmc
	if b2 < 2 {
		return 0
	}
	if b2&1 == 1 {
		return 0
	}
	b := b2 >> 1
	c := b - bmc
	if c < 1 {
		return 0
	}
	return 1
}