#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

ll gcd(ll a,ll b){
    return b == 0 ? a : gcd(b,a%b);
}

ll lcm(ll a,ll b){
    return a * b / gcd(a, b);
}

ll ksm(ll x,ll n,ll mod){
    ll res = 1;
    x = x % mod;
    while(n > 0){
        if(n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

ll fac(int n){
    ll f = 1;
    for(int i=n;i>0;i--) f *= i;
    return f;
}

ll C(int n, int m){
    return fac(n) / (fac(n - m) * fac(m));
}

int main(){

    int T;
    scanf("%d",&T);
    ll n;
    double maxx, minn, ave;
    while(T--){
        scanf("%lld %lf %lf %lf", &n, &maxx, &minn, &ave);
        if(minn > maxx){
            puts("no");
            continue;
        }

        double temp1 = maxx + (n - 1) * minn;
        double temp2 = minn + (n - 1) * maxx;
        temp1 /= n;
        temp2 /= n;
        if(temp1 > ave || temp2 < ave){
            puts("no");
        }else{
            puts("yes");
        }
    }

    return 0;

}