#include <bits/stdc++.h>
const int N = 4e5 + 10;
const int M = 9699690;
const int mod = 1e9 + 7, Gi = 332748118;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const int SIZE = 1 << 21;
char ibuf[SIZE], *iS, *iT;
using std::pair;
template <class T>
void read(T &x) {
  x = 0;
  int f = 0;
  char c = getchar();
  while (!isdigit(c)) f |= c == '-', c = getchar();
  while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
  if (f) x = -x;
}
int random(int i) { return rand() % i + 1; }
template <class T>
void ckmax(T &x, T y) {
  x = x > y ? x : y;
}
template <class T>
void ckmin(T &x, T y) {
  x = x < y ? x : y;
}
template <class T>
T Abs(T x) {
  return x > 0 ? x : -x;
}
inline int plus(int x, int y) { return x + y >= mod ? x + y - mod : x + y; }
int qp(int d, int k) {
  int f = 1;
  while (k) {
    if (k & 1) f = (1ll * (f) * (d) % mod);
    d = (1ll * (d) * (d) % mod), k >>= 1;
  }
  return f;
}
void work() {
  long long s, n, k;
  read(s), read(n), read(k);
  if (k == s)
    puts("YES");
  else if (s >= n * 2)
    puts("NO");
  else if (k > s)
    puts("NO");
  else if (n < k && k < s)
    puts("NO");
  else {
    long long nd = n / k * k * 2 + n % k;
    puts(nd <= s ? "NO" : "YES");
  }
}
int main() {
  int T = 1;
  read(T);
  while (T--) work();
  return 0;
}
