#include<bits/stdc++.h>
using namespace std;
using ll=__int128;
struct point
{
	ll x,y;
	point operator+(const point &p)const{return (point){x+p.x,y+p.y};}
	point operator-(const point &p)const{return (point){x-p.x,y-p.y};}
	ll operator*(const point &p)const{return x*p.y-y*p.x;}
	ll operator^(const point &p)const{return x*p.x+y*p.y;}
	bool operator==(const point &p)const{return x==p.x and y==p.y;}
	friend istream& operator>>(istream &is,point &p)
	{
		long long a,b;
		is>>a>>b;
		p.x=a;p.y=b;
		return is;
	}
	friend ostream& operator<<(ostream &os,const point &p)
	{
		os<<'('<<(long long)p.x<<','<<(long long)p.y<<')';
		return os;
	}
	point turn(const point &p)const
	{
		point pc=p;//pc.y*=-1;
		return (point){*this^pc,-(*this*pc)};
	}
};
bool online(const point &a,const point &b,const point &c)
{
	return (c-a)*(b-a)==0;
}
bool inmid(ll a,ll b,ll c)
{
	if(a>b)swap(a,b);
	return a<=c and c<=b;
}
bool inmid(const point &a,const point &b,const point &c)
{
	return inmid(a.x,b.x,c.x) and inmid(a.y,b.y,c.y);
}
bool onseg(const point &a,const point &b,const point &c)
{
	return online(a,b,c) and inmid(a,b,c);
}
int main()
{
	ios_base::sync_with_stdio(false);cin.tie(0);
	int T;
	cin>>T;
	while(T--)
	{
		point P,Q;
		int n;
		cin>>P>>Q>>n;
		vector<pair<point,point>> segs(n+5),Pseg,Qseg;
		for(int i=1;i<=n;i++)
		{
			cin>>segs[i].first>>segs[i].second;
		}
		Q=Q-P;
		P=P-P;
		for(int i=1;i<=n;i++)
		{
			segs[i].first=segs[i].first-P;
			segs[i].second=segs[i].second-P;
		}
		for(int i=1;i<=n;i++)
		{
			segs[i].first=segs[i].first.turn(Q);
			segs[i].second=segs[i].second.turn(Q);
		}
		Q=Q.turn(Q);
//		cerr<<P<<' '<<Q<<endl;
//		for(int i=1;i<=n;i++)
//			cerr<<segs[i].first<<' '<<segs[i].second<<endl;
		for(int i=1;i<=n;i++)
		{
			if(online(segs[i].first,segs[i].second,P) and online(segs[i].first,segs[i].second,Q))continue;
			if(onseg(segs[i].first,segs[i].second,P) and segs[i].first!=P and segs[i].second!=P)Pseg.push_back(segs[i]);
			if(onseg(segs[i].first,segs[i].second,Q) and segs[i].first!=Q and segs[i].second!=Q)Qseg.push_back(segs[i]);
		}
		/*
		cerr<<"P:"<<endl;
		for(auto [u,v]:Pseg)
			cerr<<u<<' '<<v<<endl;
		cerr<<"Q:"<<endl;
		for(auto [u,v]:Qseg)
			cerr<<u<<' '<<v<<endl;
		*/
		long long ans=1ll*Pseg.size()*Qseg.size();
		//y>0 part
		{
			for(auto &[u,v]:Pseg)
			{
				if(u.y<v.y)swap(u,v);
			}
			for(auto &[u,v]:Qseg)
			{
				if(u.y<v.y)swap(u,v);
			}
			sort(Qseg.begin(),Qseg.end(),[&](const pair<point,point> &p,const pair<point,point> &q){return (p.first-Q)*(q.first-Q)<=0;});
			vector<pair<point,int>> events;
			int a=(int)Pseg.size(),b=(int)Qseg.size();
			for(int i=0;i<a;i++)
			{
				events.emplace_back(Pseg[i].first,-1);
			}
			for(int i=0;i<b;i++)
			{
				events.emplace_back(Qseg[i].first,i);
			}
			sort(events.begin(),events.end(),[&](const pair<point,int> &p,const pair<point,int> &q){return p.first*q.first>0 or (p.first*q.first==0 and p.second<q.second);});
			vector<int> BIT(b+5);
			auto change=[&](int pos,int d)
			{
				pos++;
				for(int x=pos;x<=b;x+=x&-x)
					BIT[x]+=d;
			};
			auto query=[&](int pos)
			{
				pos++;
				int ret=0;
				for(int x=pos;x;x-=x&-x)
					ret+=BIT[x];
				return ret;
			};
			for(int i=0;i<b;i++)change(i,1);
			for(const auto &[p,id]:events)
			{
				if(id==-1)
				{
					int l=-1,r=b-1;
					while(l<r)
					{
						int mid=(l+r+1)/2;
						if((Qseg[mid].first-Q)*(p-Q)<=0)l=mid;
						else r=mid-1;
					}
//					cerr<<"query1 "<<p<<' '<<r<<endl;
					if(r>=0)ans-=query(r);
				}
				else
				{
					change(id,-1);
//					cerr<<"delete1 "<<p<<' '<<id<<endl;
				}
			}
		}
//		cerr<<"? "<<ans<<endl;
		
		//y<0 part
		{
			for(auto &[u,v]:Pseg)
			{
				if(u.y>v.y)swap(u,v);
				u.y*=-1;v.y*=-1;
			}
			for(auto &[u,v]:Qseg)
			{
				if(u.y>v.y)swap(u,v);
				u.y*=-1;v.y*=-1;
			}
			sort(Qseg.begin(),Qseg.end(),[&](const pair<point,point> &p,const pair<point,point> &q){return (p.first-Q)*(q.first-Q)<=0;});
			vector<pair<point,int>> events;
			int a=(int)Pseg.size(),b=(int)Qseg.size();
			for(int i=0;i<a;i++)
			{
				events.emplace_back(Pseg[i].first,-1);
			}
			for(int i=0;i<b;i++)
			{
				events.emplace_back(Qseg[i].first,i);
			}
			sort(events.begin(),events.end(),[&](const pair<point,int> &p,const pair<point,int> &q){return p.first*q.first>0 or (p.first*q.first==0 and p.second<q.second);});
			vector<int> BIT(b+5);
			auto change=[&](int pos,int d)
			{
				pos++;
				for(int x=pos;x<=b;x+=x&-x)
					BIT[x]+=d;
			};
			auto query=[&](int pos)
			{
				pos++;
				int ret=0;
				for(int x=pos;x;x-=x&-x)
					ret+=BIT[x];
				return ret;
			};
			for(int i=0;i<b;i++)change(i,1);
			for(const auto &[p,id]:events)
			{
				if(id==-1)
				{
					int l=-1,r=b-1;
					while(l<r)
					{
						int mid=(l+r+1)/2;
						if((Qseg[mid].first-Q)*(p-Q)<=0)l=mid;
						else r=mid-1;
					}
//					cerr<<"query2 "<<p<<' '<<r<<endl;
					if(r>=0)ans-=query(r);
				}
				else
				{
//					cerr<<"delete2 "<<p<<' '<<id<<endl;
					change(id,-1);
				}
			}
		}
		cout<<ans<<"\n";
	}
	
	return 0;
}