Forked!
Lunchbox is done with playing chess! His queen and king just got forked again!In chess, a fork is when a knight attacks two pieces of higher value, commonly the king and the queen. Lunchbox knows that knights can be tricky, and in the version of chess that he is playing, knights are even trickier: instead of moving $$$1$$$ tile in one direction and $$$2$$$ tiles in the other, knights in Lunchbox's modified game move $$$a$$$ tiles in one direction and $$$b$$$ tiles in the other.Lunchbox is playing chess on an infinite chessboard which contains all cells $$$(x,y)$$$ where $$$x$$$ and $$$y$$$ are (possibly negative) integers. Lunchbox's king and queen are placed on cells $$$(x_K,y_K)$$$ and $$$(x_Q,y_Q)$$$ respectively. Find the number of positions such that if a knight was placed on that cell, it would attack both the king and queen.
In the first test case, the knight can move 2 squares in one direction and 1 square in the other (it is essentially the same as the knight in standard chess). A knight placed on $$$(2, 1)$$$ or $$$(1, 2)$$$ would attack both the king and queen.   Example of a knight placement that forks the queen and king in the first test case. The squares that the knight attacks are highlighted in red. In the second test case, a knight placed on $$$(2, 2)$$$ would attack both the king and queen.  Example of a knight placement that does not fork the queen and king in the second test case. The knight attacks the king but not the queen. In the third test case, a knight placed on $$$(4, 4)$$$ or $$$(4, -4)$$$ would attack both the king and queen. In the fourth test case, there are no positions where the knight can attack both the king and the queen.(Credits to EnDeRBeaT for the nice images)
Each test contains multiple test cases. The first line contains an integer $$$t$$$ ($$$1 \leq t \leq 1000$$$) — the number of test cases. The description of the test cases follows.The first line of each test case contains two integers $$$a$$$ and $$$b$$$ ($$$1 \le a, b \le 10^8$$$) — describing the possible moves of the knight.The second line of each test case contains two integers $$$x_K$$$ and $$$y_K$$$ ($$$0 \le x_K, y_K \le 10^8$$$) — the position of Lunchbox's king. The third line in a test case contains $$$x_Q$$$ and $$$y_Q$$$ ($$$0 \le x_Q, y_Q \le 10^8$$$) — the position of Lunchbox's queen.It is guaranteed that Lunchbox's queen and king will occupy different cells. That is, $$$(x_K,y_K) \neq (x_Q,y_Q)$$$.
For each test case, output the number of positions on an infinite chessboard such that a knight can attack both the king and the queen. 
def solution():
    (x, b) = map(int, input().split())
    (p, q) = map(int, input().split())
    (s, t) = map(int, input().split())
    row = [x, x, b, b, -x, -x, -b, -b]
    col = [b, -b, x, -x, b, -b, x, -x]
    king = set()
    queen = set()
    for i in range(len(row)):
        king.add((p + row[i], q + col[i]))
        queen.add((s + row[i], t + col[i]))
    return len(king.intersection(queen))
n = int(input())
for i in range(n):
    print(solution())
def f(x, y, a, b):
    if a != b:
        r = []
        r += [(x + a, y + b), (x - a, y + b), (x + a, y - b), (x - a, y - b)]
        r += [(x + b, y + a), (x - b, y + a), (x + b, y - a), (x - b, y - a)]
        return r
    else:
        r = []
        r = [(x + a, y + b), (x - a, y + b), (x + a, y - b), (x - a, y - b)]
        return r
for _ in range(int(input())):
    (a, b) = map(int, input().split())
    (c, d) = map(int, input().split())
    (e, h) = map(int, input().split())
    s = f(c, d, a, b)
    r = f(e, h, a, b)
    count = 0
    for i in range(len(s)):
        for j in range(len(r)):
            if s[i] == r[j]:
                count += 1
    print(count)
t = int(input())

def solve(a, b, k1, k2, q1, q2):
    k = set()
    q = set()
    x = [-1, 1, -1, 1]
    y = [-1, -1, 1, 1]
    for i in range(4):
        k.add((k1 + a * x[i], k2 + b * y[i]))
        k.add((k1 + b * x[i], k2 + a * y[i]))
        q.add((q1 + a * x[i], q2 + b * y[i]))
        q.add((q1 + b * x[i], q2 + a * y[i]))
    res = 0
    for i in k:
        if i in q:
            res += 1
    return res
for i in range(t):
    (a, b) = map(int, input().split())
    (k1, k2) = map(int, input().split())
    (q1, q2) = map(int, input().split())
    print(solve(a, b, k1, k2, q1, q2))