#include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<random>
using namespace std;

#define int long long
#define endl "\n"
#define debug(x) "\e[1;31m"<<#x<<"="<<(x)<<"\e[0m"

template<typename T>ostream & operator<<(ostream &out,vector<T> &v){
    for(T i:v)out<<i<< (next(&i)!=v.end())?:" ";
    return out;
}
template<typename T>istream & operator>>(istream &in,vector<T> &v){
    for(T &i:v)in>>i;
    return in;
}

void init();
void task();

int32_t main(){
    int t=1;
    init();
    cin>>t;
    while(t--)task();
}


void init(){}

void task(){
    int n,M,m,avg;
    cin>>n>>M>>m>>avg;
    if(M<m || avg>M || avg<m){
        cout<<"no"<<endl;
    }
    else if(m+M*(n-1)>=avg*n && avg*n>=M+m*(n-1))
        cout<<"yes"<<endl;
    else cout<<"no"<<endl;
}