#include<cstdio>
#include<iostream>
#include<set>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<string>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib> 
#include<chrono>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
//#define int long long
//#define double long double
using namespace std;
    typedef long long ll;
    const int maxn=400505;
    const int inf=0x3f3f3f3f;
    int n,m,k;
    int ma,mi,av;
    double eps=1e-8;
    inline int sgn(double  x){
        return (x > eps) - (x < -eps);
    }
    //x >= y 写成 sgn(x - y) >= 0
    void solve(){
        cin>>n>>ma>>mi>>av;
        if(mi>ma){
            cout<<"no"<<endl;
            return ;
        }
        if(mi==ma){
            if(av==mi)    cout<<"yes"<<endl;
            else         cout<<"no"<<endl;
            return ;
        }
        if(n==1){
            cout<<"no"<<endl;
            return;
        }
        if(n==2){
            if(mi+ma==av*2)    cout<<"yes"<<endl;
            else        cout<<"no"<<endl;
            return ;
        }
        double d=(n*av-ma-mi-0.0)/(n-2.0);
        if(sgn(d-mi)>=0&&sgn(ma-d)>=0)
            cout<<"yes"<<endl;
        else
            cout<<"no"<<endl;
    }
    signed main(){
        IOS
        #ifndef ONLINE_JUDGE
            freopen("IO\\in.txt","r",stdin);
            freopen("IO\\out.txt","w",stdout);
        #endif
        int tn=1;
        cin>>tn;
        while(tn--){
            solve();
        }
    }