#include<bits/stdc++.h>
//#define int long long
using namespace std;
const int N=500;
int f[N+5][N+5][12];
vector<int> vec;
int n,m,x[4],y[4];
int mex(vector<int> vec){
	sort(vec.begin(),vec.end());
	vec.erase(unique(vec.begin(),vec.end()),vec.end());
//	for(int u:vec) cout<<u<<" ";
	for(int i=0;i<(int)vec.size();i++){
		if(vec[i]!=i){
//			cout<<i<<'\n';
			return i;
		}
	}return vec.size();
}
#define lf(x,y,z) vec.push_back(dfs(x,y,z))
int dfs(int x,int y,int id){
	if(f[x][y][id]!=-1) return f[x][y][id];
//	cout<<x<<" "<<y<<" "<<id<<'\n' ;
//	if(x<0||y<0) cout<<x<<" "<<y<<" "<<id<<'\n';
	if(!x||!y) return 0;
	vector<int> vec;
	if(id==0){
		lf(x-1,y,0);lf(x,y-1,0);lf(x-1,y-1,0);
	}
	if(id==1){
		if(x==1) return dfs(x,y-1,0);
		if(y==1) return dfs(x-1,y,0);
		lf(x-1,y,0);lf(x,y-1,0);lf(x-1,y-1,0);
		if(x>1) lf(x-1,y,1);
		if(y>1) lf(x,y-1,1);
		if(x>1&&y>1) lf(x-1,y-1,1);
	}
	if(id==2){
		if(y==2) return dfs(x-1,y,0);
		if(x==1) return dfs(x,y-2,0);
		lf(x-1,y,0);lf(x,y-1,1);lf(x-1,y-1,0);
		if(x>1) lf(x-1,y,2),lf(x-1,y-1,1);
		if(y>2) lf(x,y-1,2);
		if(x>1&&y>2) lf(x-1,y-1,2);
	}
	if(id==4){
		lf(x-1,y,1);lf(x,y-1,1);lf(x-1,y-1,1);lf(x-1,y-1,0);
		if(x>2) lf(x-1,y,4),lf(x-1,y-1,1);
		if(y>2) lf(x,y-1,4),lf(x-1,y-1,1);
		if(x>2&&y>2) lf(x-1,y-1,4);
	}
	if(id==5){
//		if(y<3) cout<<x<<" "<<y<<'\n';
		if(y==3) return dfs(x-1,y,0);
		if(x==1) return dfs(x,y-3,0);
		lf(x-1,y,0);lf(x,y-1,2);lf(x-1,y-1,0);
		if(x>1) lf(x-1,y,5),lf(x-1,y-1,2);
		if(y>3) lf(x,y-1,5);
		if(x>1&&y>3) lf(x-1,y-1,5);
	}
	if(id==7){
		if(x==2) return dfs(x,y-1,1);
		if(y==2) return dfs(x-1,y,1);
		lf(x-1,y,1);lf(x-1,y,2);lf(x,y-1,1);lf(y-1,x,2);lf(x-1,y-1,0);lf(x-1,y-1,1);
		if(x>2) lf(x-1,y,7),lf(x-1,y-1,1),lf(y-1,x-1,2);
		if(y>2) lf(x,y-1,7),lf(x-1,y-1,1),lf(y-1,x-1,2);
		if(x>2&&y>2) lf(x-1,y-1,7);
	}
	if(id==8){
		lf(x-1,y,1);lf(x-1,y,2);lf(x,y-1,4),lf(x,y-1,2);
		lf(x-1,y-1,1);lf(x-1,y-1,0);lf(x-1,y-1,2);
		if(x>2) lf(x-1,y,8),lf(x-1,y-1,4),lf(x-1,y-1,2);
		if(y>3) lf(x,y-1,8),lf(x-1,y-1,1),lf(x-1,y-1,2);
		if(x>2&&y>3) lf(x-1,y-1,8);
	}
	if(id==10){
		lf(x-1,y,4);lf(x,y-1,4);lf(x-1,y-1,4);lf(x-1,y-1,1);
		if(x>3) lf(x-1,y,10),lf(x-1,y-1,4);
		if(y>3) lf(x,y-1,10),lf(x-1,y-1,4);
		if(x>3&&y>3) lf(x-1,y-1,10);
	}
	f[x][y][id]=mex(vec);
	return f[x][y][id];
}
int ALL;
void solve(){
	cin>>n>>m;
	for(int i=1;i<=3;i++) cin>>x[i]>>y[i];
	int num1=0,num2=0;
	for(int i=1;i<=3;i++){
		for(int j=i+1;j<=3;j++){
			num1+=(x[i]==x[j]);
			num2+=(y[i]==y[j]);
		}
	}if(num1==3) num1--;if(num2==3) num2--;
	num1=3-num1,num2=3-num2;
	if(num1>num2){
		swap(num1,num2);
		swap(n,m);
	}
	int ans=0;
	if(num1==1&&num2==3){
		ans=dfs(n,m,5);
	}
	else if(num1==2&&num2==2){
		ans=dfs(n,m,7);
	}
	else if(num1==2&&num2==3){
		ans=dfs(n,m,8);
	}
	else ans=dfs(n,m,10);
	ALL^=ans;
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	memset(f,-1,sizeof(f));
	int tt;cin>>tt;
	while(tt--) solve();
	if(ALL) cout<<"OvO";
	else cout<<"QAQ";
}
/*
*/