Let’s assume $$$a$$$ and $$$b$$$ are co-prime, because otherwise we can divide both by their GCD without changing the answer. The size of the range $$$[L, R]$$$, let’s denote it as $$$S$$$, can be anything between $$$a\cdot x-a+1$$$ to $$$a\cdot x+a-1$$$ to satisfy the first condition. To satisfy the second condition, $$$S$$$ should be in the range $$$[b\cdot y-b+1, b\cdot y+b-1]$$$. Then we check if the two intervals intersect or not. It can be proven that the answer exists if and only if the two intervals intersect.

from math import gcd
for _ in range(int(input())):
   a, b, x, y = map(int,input().split())
   g = gcd(a, b)
   a //= g
   b //= g
   L1 = a*x - a + 1
   L2 = b*y - b + 1
   R1 = a*x + a - 1
   R2 = b*y + b - 1
   if max(L1, L2) <= min(R1, R2):
      print("Yes")
   else:
      print("No")

from math import *

q = int(input())
for i in range(q):
    a, b, x, y = map(int, input().split())
    g = gcd(a, b)
    a //= g
    b //= g
    if abs(a * x - b * y) <= a + b - 2:
        print('Yes')
    else:
        print('No')