//#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#define ll long long  
using namespace std;
ll t;
ll n,maxn,minn,ave;

int main()
{
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld %lld %lld %lld",&n,&maxn,&minn,&ave);
        //cin>>n>>maxn>>minn>>ave;
        ll k = n*ave-minn-maxn;
        ll x = minn*(n-2);
        ll y = maxn*(n-2);
        if(minn>maxn)  cout<<"no"<<endl;
        else if(n==1) {
            if(maxn==minn&&minn==ave)
                cout<<"yes"<<endl;
            else 
                cout<<"no"<<endl;
        }
        else if(n==2) {
            if(maxn+minn==2*ave)
                cout<<"yes"<<endl;
            else 
                cout<<"no"<<endl;
        }
        else if(k<=y&&k>=x)  cout<<"yes"<<endl;
        else  cout<<"no"<<endl;
    }
    return 0;
}