import sys
input = sys.stdin.buffer.readline
from math import gcd
def q(n, m, a, b, c=0):
    if m == 0:
        return 0, 0, 0
    a1, a2 = a // m, a % m
    b1, b2 = b // m, b % m
    y = (a2 * n + b2) // m
    ff, gg, hh = q(y, a2, m, m + a2 - b2 - 1, c + 1)
    nn = n * (n - 1) // 2
    f = n * y - ff
    g = n * y * y - ff - 2 * hh
    h = nn * y + (ff - gg) // 2
    g += n * (2 * n - 1) * (n - 1) * a1 * a1 // 6
    g += 2 * nn * a1 * b1
    g += b1 * b1 * n
    g += 2 * a1 * h
    g += 2 * b1 * f
    f += a1 * nn + b1 * n
    h += nn * (a1 * (2 * n - 1) + 3 * b1) // 3
    return f, g, h
def main() -> None:
    n, m, a, b = map(int, input().split())
    gccd = gcd(m, a)
    m, a, b = m // gccd, a // gccd, b // gccd
    ans = 0
    f, g, h = q(n, m, a, b)
    ans -= (n - 1) * f
    ans += 2 * h
    t = a * (n - 1) // m
    y = m - a * (n - 1) + t * m
    f, g, h = q(n, m, a, y)
    ans += f
    ans += h
    ans -= n * (n + 1) // 2 * t
    k1, k2 = n // m, n % m
    ans -= (k1 + 1) * (k1 + 2) // 2 * k2
    ans -= k1 * (k1 + 1) // 2 * (m - k2)
    print(ans)
    return
for i in range(int(input())):
    main()