#include<cstdio>
#include<algorithm>
#include<cstring>
#define N 
using namespace std;
inline int read(){
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){
        if(c=='-')f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9'){
        x*=10;x+=c-'0';
        c=getchar();
    }
    return x*f;
}
//int head[N],last;
//struct u2003{
//    int nx,b;
//}e[M];
//inline void build(int a,int b){
//    e[++last].b=b;
//    e[last].nx=head[a];
//    head[a]=last;
//}
int main(){
    int t=read();
    int n,ave,maxn,minn;
    for(int i=1;i<=t;i++){
        n=read();maxn=read();minn=read();ave=read();
        if(maxn<minn)printf("no\n");
        else{
            if(maxn*(n-1)+minn<ave*n||ave*n<minn*(n-1)+maxn)printf("no\n");
            else printf("yes\n");
        }
    }
    return 0;
}