#include <bits/stdc++.h>

void solve() {
  int n, max, min, ave;
  std::cin >> n >> max >> min >> ave;

  if (min > max) {
    std::cout << "no\n";
    return;
  }

  long long lower = max + min * 1ll * (n - 1);
  long long upper = min + max * 1ll * (n - 1);

  if (lower <= ave * 1ll * n && ave * 1ll * n <= upper)
    std::cout << "yes\n";
  else std::cout << "no\n";
}

signed main() {
  int T; std::cin >> T;
  while (T--) solve();
}