#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

bool ck(vector<double> a) {
  if(a[0]==a[2]) return 0;
  if(a[0]>a[1]&&a[1]<a[2]) return 1;
  if(a[0]<a[1]&&a[1]>a[2]) return 1;
  return 0;
}

vector<int> ck2(vector<double> a) {
  vector<int> c(2);
  rep(i,2) {
    if(a[i]<a[i+1]) c[i]=0;
    else if(a[i]>a[i+1]) c[i]=2;
    else c[i]=1;
  }
  return c;
}

void Main() {
  ll T,n=3;
  cin >> T;
  while(T--) {
    vector<double> a(n),b(n);
    rep(i,n) cin >> a[i];
    rep(i,n) cin >> b[i];
    vector<int> c=ck2(a);
    double l=0,r=MAX;
    if(ck(a)) {
      pr("YES");
      goto end;
    }
    rep(i,20) {
      r=MAX;
      rep(t,100) {
        double m=(l+r)/2;
        vector<double> d=a;
        rep(j,n) d[j]=a[j]+b[j]*m;
        if(ck2(d)==c) l=m;
        else r=m;
      }
      l=r;
      vector<double> d=a;
      rep(j,n) d[j]=a[j]+b[j]*l;
      if(ck(d)) {
        pr("YES");
        goto end;
      }
      c=ck2(d);
    }
    pr("NO");
  end:;
  }
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}