#include<bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
typedef long long ll;
typedef pair<int,int>pii;
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
const double pi = acos(-1.0);
const ll INF = 0x3f3f3f3f3f3f3f3f;
#define rep(i,x,y) for(auto i=(x);i<=(y);++i)
#define dep(i,x,y) for(auto i=(x);i>=(y);--i)
const int dx[] = { -1,0,1,0 }, dy[] = { 0,1,0,-1 };
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll poww(ll a, ll b) { ll s = 1; while (b) { if (b & 1)s = (s * a) % mod; a = (a * a) % mod; b >>= 1; }return s % mod; }
/*----------------------------------------------------------------------------------------------------------------------*/

const int N = 1e6 + 11;
ll n,m;

void solve()
{
    int a,b,c,d,e,f;
    cin>>a>>b>>c>>d;
    if(a==1)
    {
        if(b==c&&b==d&&c==d)cout<<"yes"<<endl;
        else cout<<"no"<<endl;
        return;
    }
    if(c>b)
    {
        cout<<"no"<<endl;
        return;
    }
    e=b*(a-1)+c;
    f=c*(a-1)+b;
    d*=a;
    // cout<<f<<' '<<e<<' '<<d<<endl;
    if(d>=f&&d<=e)cout<<"yes"<<endl;
    else cout<<"no"<<endl;
}


/*----------------------------------------------------------------------------------------------------------------------*/
int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    ll T = 1;
    cin >> T;
    while (T--)solve();
    return 0;
}