#include<bits/stdc++.h>
#define db double
#define reg register
#define LL long long
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define ull unsigned long long
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(int i=head[a];i;i=e[i].nxt)


using namespace std;
bool Handsome;
inline int rd(){
    reg int x=0;reg char o=getchar();reg bool O=0;
    for(;o<48 || 57<o;o=getchar())if(o=='-')O=1;
    for(;48<=o && o<=57;o=getchar())x=(x<<1)+(x<<3)+(o^48);
    return O?-x:x;
}
inline void Mi(int &x,int y){if(x>y && (x=y));}
inline void Mx(int &x,int y){if(x<y && (x=y));}
int n,mx,mi,av;
const db e=1e-10;
void solve(){
    n=rd(),mx=rd(),mi=rd(),av=rd();
    if(n==1){
        if(mx==mi && mi==av)puts("yes");
        else puts("no");
        return;
    }
    if(n==2){
        if(mx>=mi && mx+mi==av+av)puts("yes");
        else puts("no");
        return;
    }
    int sum=n*av;
    sum-=mx+mi;n-=2;
    db x=1.0*sum/n;
    if(x-e>mx || x+e<mi)puts("no");
    else puts("yes");
}
bool Most;
int main(){
//    printf("%.2lfMB\n",(&Most-&Handsome)/1024.0/1024.0);
    int t=rd();
    while(t--)solve();
    return 0;
}