#include "iostream"
#include "cstring"
#include "cstdio"
#include "algorithm"
#include "queue"
#include "vector"
#include "queue"
#include "stack"
#include "ctime"
#include "set"
#include "map"
using namespace std;
#define fi first
#define se second
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define mp make_pair
#define rep( i , a , b ) for( int i = (a) , i##end = b ; i <= i##end ; ++ i )
#define per( i , a , b ) for( int i = (a) , i##end = b ; i >= i##end ; -- i )
#define mem( a ) memset( a , 0 , sizeof (a) )
#define all( x ) x.begin() , x.end()
//#define int long long
typedef long long ll;
const int MAXN = 26 + 10;
const int P = 998244353;
int n , m , k;
const int dirx[] = { 1,0,-1,0 };
const int diry[] = { 0,1,0,-1 };

int xs , ys , xt , yt;

struct wall {
	int x0 , y0 , x1 , y1;
	void in( ) {
		scanf("%d%d%d%d",&x0,&y0,&x1,&y1);
	}
} A[MAXN] ;

int F[MAXN][MAXN][4];

int vis[MAXN][MAXN] , flg;
void dfs( int x , int y ) {
	if( vis[x][y] ) return;
	if( x == xt && y == yt ) {
		flg = 1; return;
	}
	vis[x][y] = 1;
	rep( d , 0 , 3 ) if( !F[x][y][d] ) {
		int xx = x + dirx[d] , yy = y + diry[d];
		if( xx < 0 || yy < 0 || xx >= n || yy >= m ) continue;
		dfs( xx , yy );
	}
}

void solve() {
	cin >> n >> m >> k;
	cin >> xs >> ys >> xt >> yt;
	rep( i , 1 , k ) A[i].in( );
	int res = k;
	for( int s = 0 ; s < ( 1 << k ) ; ++ s ) {
		rep( i , 1 , k ) if( ~s & ( 1 << i - 1 ) ) {
			if( A[i].x0 != A[i].x1 ) {
				rep( x , A[i].x0 , A[i].x1 - 1 ) 
					F[x][A[i].y0 - 1][1] = 1 , F[x][A[i].y0][3] = 1;
			} else {
				rep( y , A[i].y0 , A[i].y1 - 1 ) 
					F[A[i].x0][y][2] = 1 , F[A[i].x0 - 1][y][0] = 1;
			}
		}
		flg = 0;
		mem( vis );
		dfs( xs , ys );
		if( flg ) res = min( res , __builtin_popcount( s ) );
		mem( F );
	}
	cout << res << endl;
}

signed main() {
//	freopen("in","r",stdin);
//	freopen("out","w",stdout);
	int T;cin >> T;while( T-- ) solve();
//	solve();
}