#include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<random>
#include<chrono>
typedef long long ll;
typedef unsigned un;
typedef std::vector<int> P;
typedef std::pair<int,int> pii;
ll read(){ll x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9')x=x*10+(c-'0'),c=getchar();return f*x;}
ll max(ll a,ll b){return a>b?a:b;}
ll min(ll a,ll b){return a<b?a:b;}
template <typename T> bool umax(T& a,T t){if(t>a)return a=t,1;return 0;}
template <typename T> bool umin(T& a,T t){if(t<a)return a=t,1;return 0;}
/**********/
int main()
{
    int task=read();
    while(task--)
    {
        int n=read(),mxv=read(),mnv=read(),avg=read();
        if(n==1)
        {
            puts(mxv==mnv&&mxv==avg?"yes":"no");
            continue;
        }
        if(mnv>mxv)puts("no");
        else if(mxv==mnv)puts(avg==mxv?"yes":"no");
        else
        {
            ll lb=mnv*(n-1)+mxv;
            if(avg*n<lb)puts("no");
            else
            {
                ll rb=mxv*(n-1)+mnv;
                if(avg*n>rb)puts("no");
                else puts("yes");
            }
        }
    }
    return 0;
}