/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int INF=1e18;

#define pdd pair<double,double>
const double eps=1e-9;
pdd operator +(pdd x,pdd y)
{
	return mp(x.fi+y.fi,x.se+y.se);
}
pdd operator -(pdd x,pdd y)
{
	return mp(x.fi-y.fi,x.se-y.se);
}
pdd operator *(pdd x,double y)
{
	return mp(x.fi*y,x.se*y);
}
double dot(pdd x,pdd y)
{
	return x.fi*y.fi+x.se*y.se;
}
double det(pdd x,pdd y)
{
	return x.fi*y.se-y.fi*x.se;
}
// point q on seg p1--p2
bool onseg(pdd p1,pdd p2,pdd q)
{
	return fabs(det(p1-q,p2-q))<eps&&dot(p1-q,p2-q)<eps;
}
// line p1--p2 q1--q2 intersection
bool good(pdd p1,pdd p2,pdd q1,pdd q2)
{
	if(fabs(det(q2-q1,p2-p1))<eps) return 0;
	return 1;
}
pdd inter(pdd p1,pdd p2,pdd q1,pdd q2)
{
	return p1+(p2-p1)*(det(q2-q1,q1-p1)/det(q2-q1,p2-p1));
}
// if seg p1--q1 p2--q2 has intersection
bool hascommon(pdd p1,pdd q1,pdd p2,pdd q2)
{
	if(fabs(det(p1-q1,p2-q2))<eps) return onseg(p1,q1,p2)||onseg(p1,q1,q2)||onseg(p2,q2,p1)||onseg(p2,q2,q1);
	pdd tmp=inter(p1,q1,p2,q2);
	return onseg(p1,q1,tmp)&&onseg(p2,q2,tmp);
}
// Point A,B,C share one line
bool shareoneline(pdd A,pdd B,pdd C)
{
	return fabs((C.fi-A.fi)*(B.se-A.se)-(B.fi-A.fi)*(C.se-A.se))<eps;
}
// distance between Point P and line L1--L2
double point_to_line(pdd P,pdd L1,pdd L2)
{
	double x0=P.fi,y0=P.se;
	double x1=L1.fi,y1=L1.se;
	double x2=L2.fi,y2=L2.se;
	return fabs(((y1-y2)*x0-(x1-x2)*y0+(x1*y2-x2*y1))/sqrt((y1-y2)*(y1-y2)+(x1-x2)*(x1-x2)));
} 
int dist(pii x1,pii x2)
{
	return ((x1.fi-x2.fi)*(x1.fi-x2.fi)+(x1.se-x2.se)*(x1.se-x2.se));
}
void solve()
{
	int x1,y1,x2,y2,x3,y3,x4,y4;
	cin>>x1>>y1>>x2>>y2>>x3>>y3>>x4>>y4;
	if((x1==x3&&y1==y3&&x2==x4&&y2==y4)) cout<<"Yes\n";
	else 
	{
		int dx1=x2-x1,dy1=y2-y1;
		int dx2=x4-x3,dy2=y4-y3;
		int g1=__gcd(dx1,dy1),g2=__gcd(dx2,dy2);
		dx1/=g1,dy1/=g1,dx2/=g2,dy2/=g2;
		if(dist(mp(x1,y1),mp(x2,y2))>dist(mp(x3,y3),mp(x4,y4))&&dx1==dx2&&dy1==dy2) cout<<"Yes\n"; 
		else cout<<"No\n";
	}
	
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
	cin>>_;
	while(_--) solve();
	return 0;
}