#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1e9 + 7;
const ll mod = 1e9+7;
int main() {
    int t;
    scanf("%d",&t);
    while(t --){
        int n;
        double ma,mi,av;
        scanf("%d %lf %lf %lf",&n,&ma,&mi,&av);
        if(ma<mi) cout<<"no"<<'\n';
        else if(ma<av||mi>av) cout<<"no"<<'\n';
        else if(n == 1){
            if(ma==mi&&mi==av) {
                cout<<"yes"<<'\n';
            }else {
                cout<<"no"<<'\n';
            }
        }else if( n == 2){
            if((ma+mi)/2 == av){
                
                cout<<"yes"<<'\n';
            }
            else cout<<"no"<<'\n';
        }else {
            if(mi==ma){
                if(ma==av) cout<<"yes"<<'\n';
                else cout<<"no"<<'\n';
            }
            else {
                double cc=n*av;
                cc-=(mi+ma);
                cc=cc/(n-2);
                if(mi<=cc&&cc<=ma){
                    cout<<"yes"<<'\n';
                }else cout<<"no"<<'\n';
            }
    }

}
    return 0;
}