#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int N;
int X[3],Y[3];
main()
{
	cin>>N;
	for(;N--;)
	{
		for(int i=0;i<3;i++)cin>>X[i];
		for(int i=0;i<3;i++)cin>>Y[i];
		vector<int>id={0,1,2};
		bool flag=false;
		do{
			if(id[1]==1)continue;
			double L=0,R=1e15;
			for(int i=0;i<2;i++)
			{
				long ax=X[id[i]],ay=Y[id[i]],bx=X[id[i+1]],by=Y[id[i+1]];
				if(ay==by)
				{
					if(bx-ax<0);
					else R=-1;
				}
				else if(ay>by)
				{
					L=max(L,(bx-ax)/(double)(ay-by));
				}
				else
				{
					R=min(R,(bx-ax)/(double)(ay-by));
				}
			}
			if(L<R)flag=true;
		}while(next_permutation(id.begin(),id.end()));
		cout<<(flag?"YES":"NO")<<endl;
	}
}