#include #define rep(i, a, b) for (int i = a; i <= b; i++) #define per(i, a, b) for (int i = a; i >= b; i--) using namespace std; typedef unsigned long long ull; typedef pair pii; typedef long long ll; template inline void read(T &f) { f = 0; T fu = 1; char c = getchar(); while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); } while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); } f *= fu; } template void print(T x) { if (x < 0) putchar('-'), x = -x; if (x < 10) putchar(x + 48); else print(x / 10), putchar(x % 10 + 48); } template void print(T x, char t) { print(x); putchar(t); } int T, n, a, b, c; int main() { read(T); while (T--) { read(n); read(a); read(b); read(c); swap(a, b); if (n == 1) { if (a == b && b == c) puts("yes"); else puts("no"); continue; } if (n == 2) { if (a <= b && a + b == c * 2) puts("yes"); else puts("no"); continue; } if (a <= b && 1ll * a * (n - 1) + b <= 1ll * c * n && 1ll * c * n <= a + 1ll * b * (n - 1)) puts("yes"); else puts("no"); } return 0; }