package main

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

var sc = bufio.NewScanner(os.Stdin)
var wr = bufio.NewWriter(os.Stdout)

func out(x ...interface{}) {
	fmt.Fprintln(wr, x...)
}

func getI() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getF() float64 {
	sc.Scan()
	i, e := strconv.ParseFloat(sc.Text(), 64)
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getI()
	}
	return ret
}

func getS() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

type pair struct {
	a, b int
}

func divisor(n int) []pair {
	ret := []pair{}
	for i := 1; i*i <= n; i++ {
		if n%i == 0 {
			ret = append(ret, pair{i, n / i})
		}
	}
	return ret
}

func f(X, Y int) {
	ans := 0
	for b := 1; b < Y; b++ {
		v := X*X - 4*(b*Y-b*b)
		vi := int(math.Sqrt(float64(v)))
		if vi*vi != v {
			continue
		}
		C := []int{X + vi, X - vi}
		for _, c := range C {
			if c >= Y {
				continue
			}
			if c%2 != 0 {
				continue
			}
			c /= 2
			if c*X-b*Y == c*c-b*b {
				if (X-c)%b == 0 {
					// a := (X - c) / b
					// out(a, b, c)
					ans++
				}
			}
		}
	}
	out(ans)
}

func solve(x, y int) {
	cnt := 0
	for a := 1; a <= x; a++ {
		for b := 1; a*b < x; b++ {
			c := x - (a * b)
			if c == 0 {
				continue
			}
			if b == y-(a*c) {
				out(a, b, c)
				cnt++
			}
		}
	}
	out(cnt)
}

func main() {
	defer wr.Flush()
	sc.Split(bufio.ScanWords)
	sc.Buffer([]byte{}, 1000000)
	// this template is new version.
	// use getI(), getS(), getInts(), getF()
	s := getI()
	for i := 0; i < s; i++ {
		x, y := getI(), getI()
		f(x, y)
	}
}