def judge(morning, buy, thresh, adder)
  # 朝より購入のほうが多い -> 即NG
  return false if morning < buy

  # 購入より補充のほうが少ない -> 即NG
  return false if adder < buy

  # 購入よりしきい値のほうが多い -> 即OK
  # 購入-1 <= しきい値           -> 即OK
  return true if buy-1 <= thresh

  # 初期処理
  # morningをthreshぎりぎりまで減らす
  if thresh < morning
    d = (morning - thresh) / buy
    morning -= buy * d
  end
  # adderもthreshぎりぎりまで減らす
  if thresh < adder
    d = (adder - thresh) / buy
    adder -= buy * d
  end

  s = morning
  s_ary = []
  inc = adder - buy

  while true do
    if s <= thresh
      # ここの回数を減らしたい！
      # s += adder
      # 単純に加算するのではなく、(adder-buy)ずつ増やしていって、threshを超えさせよう

      # thresh < s + (adder - buy) * XXX
      return true if inc == 0

      d = (thresh - s) / inc + 1
      s += inc * d
    else
      # 補充なしターン
      if s < buy
        return false
      end
      if s_ary.index(s)
        return true
      end
      # thresh上に出たところだけ記憶しておく
      s_ary << s
      s -= buy
    end
  end
end

def main
  t = ARGF.gets.to_i

  t.times do
    morning, buy, thresh, adder = ARGF.gets.split.map(&:to_i)
    if judge(morning, buy, thresh, adder)
      puts 'Yes'
    else
      puts 'No'
    end
  end
end

if __FILE__ == $0
  main
end
