#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long ll;
const int M=1e5+5;
int a[M];
int main()
{
    int t,maxn,n,minn,ave;
    cin>>t;
    while(t--)
    {
        scanf("%d%d%d%d",&n,&maxn,&minn,&ave);
        if(maxn<minn||ave<minn||ave>maxn)
            puts("no");
        else if(n==1&&(maxn!=ave||maxn!=minn||minn!=ave))
            puts("no");
        else if(n==2&&maxn+minn!=2*ave)
            puts("no");
        else if((n*ave)-maxn-minn<minn*(n-2)||(n*ave)-maxn-minn>maxn*(n-2))
            puts("no");
        else puts("yes");
    }
    return 0;
}