#include <bits/stdc++.h>
const int maxn=20;
bool vis[maxn][maxn][maxn];
std::vector<int> xx1[maxn],xx2[maxn];
std::vector<int> yy1[maxn],yy2[maxn];
struct node
{
	int x,y,dis;
	bool operator<(node nod)const
	{
		return dis>nod.dis;
	}
};
int bfs(int xs,int ys,int xt,int yt,int n,int m)
{
	std::priority_queue<node> q;
	int cnt=0;
	q.push((node){xs,ys});
	while(!q.empty()){
		node nod=q.top();
		q.pop();
		int x=nod.x,y=nod.y,dis=nod.dis;
		if(x==xt&&y==yt)
			return dis;
		if(vis[x][y][dis])
			continue;
		vis[x][y][dis]=1;
		//std::cout<<x<<' '<<y<<' '<<dis<<std::endl;
		int cnt=0;
		if(x-1>=0){
			for(int j=0;j<xx1[x].size();j++){
					int y1=xx1[x][j],y2=xx2[x][j];
					if(y1<=y&&y<y2)
						cnt++;
				}
				q.push((node){x-1,y,dis+cnt});
		}
		cnt=0;
		if(x+1<n){
			for(int j=0;j<xx1[x+1].size();j++){
					int y1=xx1[x+1][j],y2=xx2[x+1][j];
					if(y1<=y&&y<y2)
						cnt++;
				}
				q.push((node){x+1,y,dis+cnt});
		}
		cnt=0;
		if(y-1>=0){
				for(int j=0;j<yy1[y].size();j++){
					int x1=yy1[y][j],x2=yy2[y][j];
					if(x1<=x&&x<x2)
						cnt++;
				}
				q.push((node){x,y-1,dis+cnt});
		}
		cnt=0;
		if(y+1<m){
			for(int j=0;j<yy1[y+1].size();j++){
					int x1=yy1[y+1][j],x2=yy2[y+1][j];
					if(x1<=x&&x<x2)
						cnt++;
				}
				q.push((node){x,y+1,dis+cnt});
			}
		}
	return -1; 
}

void solve()
{
	memset(vis,0,sizeof(vis));
	for(int i=0;i<maxn;i++){
		xx1[i].clear();
		xx2[i].clear();
		yy1[i].clear();
		yy2[i].clear();
	}
	int n,m,k;
	std::cin>>n>>m>>k;
	int xs,ys,xt,yt;
	std::cin>>xs>>ys>>xt>>yt;
	for(int i=0;i<k;i++)
	{
		int x1,x2,y1,y2;
		std::cin>>x1>>y1>>x2>>y2;
		if(x1==x2){
			if(y1>y2)
				std::swap(y1,y2);
			xx1[x1].push_back(y1);
			xx2[x1].push_back(y2);
		}
		if(y1==y2){
			if(x1>x2)
				std::swap(x1,x2);
			yy1[y1].push_back(x1);
			yy2[y1].push_back(x2);
		}
	}
	std::cout<<bfs(xs,ys,xt,yt,n,m)<<std::endl;
}
int main()
{
	int t;
	std::cin>>t;
	while(t--)
	{
		solve();
	}
	return 0;
}