#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
int m;
LL n,a,b,c;
int main()
{

   scanf("%d",&m);
    while (m -- )
    {
        scanf("%lld%lld%lld%lld",&n,&a,&b,&c);
        // cout<<a<<" "<<b<<" "<<c<<endl;
        if(n==1)
        {
            if(a==b&&b==c)puts("yes");
            else puts("no");
        }
        else 
        if(n==2)
        {
            if(a<b||a<c||c<b)
            {
                puts("no");
                continue;
            }
            if(2*c!=(a+b))puts("no");
            else puts("yes");
        }
        else
        {
            if(a<b||a<c||c<b)
            {
                puts("no");
                continue;
            }
            if((n-1)*b+a<=n*c&&n*c<=(n-1)*a+b)puts("yes");
            else puts("no");
        }
    }
    return 0;
}