//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <complex>
//#include <random>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/priority_queue.hpp>
#define itn int
#define nit int
#define ll long long
#define ms multiset
#define F(i,a,b) for(register int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(register int i=a,i##end=b;i>=i##end;--i)
#define re register
#define ri re int
#define il inline
#define pii pair<int,int>
#define cp complex<double>
#define vi vector<int>
#define ull unsigned long long
#define mem0(x) memset(x,0,sizeof(x))
#define mem0x3f(x) memset(x,0x3f,sizeof(x))
using namespace std;
//using namespace __gnu_pbds;
const double Pi=acos(-1);
namespace fastIO {
	template<class T>
	inline void read(T &x) {
		x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		if(fu)x=-x;
	}
	inline int read() {
		int x=0;
		bool fu=0;
		char ch=0;
		while(ch>'9'||ch<'0') {
			ch=getchar();
			if(ch=='-')fu=1;
		}
		while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
		return fu?-x:x;
	}
	template<class T,class... Args>
	inline void read(T& t,Args&... args) {
		read(t);
		read(args...);
	}
	char _n_u_m_[40];
	template<class T>
	inline void write(T x) {
		if(x==0) {
			putchar('0');
			return;
		}
		T tmp = x > 0 ? x : -x ;
		if( x < 0 ) putchar('-') ;
		register int cnt = 0 ;
		while( tmp > 0 ) {
			_n_u_m_[ cnt ++ ] = tmp % 10 + '0' ;
			tmp /= 10 ;
		}
		while( cnt > 0 ) putchar(_n_u_m_[ -- cnt ]) ;
	}
	template<class T>
	inline void write(T x ,char ch) {
		write(x);
		putchar(ch);
	}
}
using namespace fastIO;
int sg[2002][2002];
bitset<2002>a[2002],b[2002],c[4002],temp;
int n,x[2002],y[2002];
int main() {
	n=2000;
	F(i,1,n) {
		F(j,1,n) {
			temp=a[i]|b[j]|c[i-j+2000];
			if(i>=3&&j>=2)temp[sg[i-2][j-1]]=1;
			if(i>=2&&j>=3)temp[sg[i-1][j-2]]=1;
			sg[i][j]=(~temp)._Find_first();
			a[i][sg[i][j]]=b[j][sg[i][j]]=c[i-j+2000][sg[i][j]]=1;
		}
	}
	F(iak,1,read()) {
		int k=read(),s=0;
		F(i,1,k)read(x[i],y[i]),s^=sg[x[i]][y[i]];
		if(!s)puts("-1 -1 -1");
		else {
			bool flag=false;
			auto ans=make_pair(114514,114514);
			F(i,1,k) {
				UF(j,x[i]-1,1) {
					if(j<y[i]) {
						if(!(s^sg[x[i]][y[i]]^sg[x[i]-j][y[i]-j])) {
							ans=min(ans,make_pair(x[i]-j,y[i]-j));
						}
					}
					if(!(s^sg[x[i]][y[i]]^sg[x[i]-j][y[i]])) {
						ans=min(ans,make_pair(x[i]-j,y[i]));
					}
				}
				UF(j,y[i]-1,1) {
					if(!(s^sg[x[i]][y[i]]^sg[x[i]][y[i]-j])) {
						ans=min(ans,make_pair(x[i],y[i]-j));
					}
				}

				if(x[i]>2&&y[i]>1) {
					if(!(s^sg[x[i]-2][y[i]-1]^sg[x[i]][y[i]])) {
						ans=min(ans,make_pair(x[i]-2,y[i]-1));
					}
				}
				if(x[i]>1&&y[i]>2) {
					if(!(s^sg[x[i]-1][y[i]-2]^sg[x[i]][y[i]])) {
						ans=min(ans,make_pair(x[i]-1,y[i]-2));
					}
				}
				if(ans.first<1e5) {
					write(i,' ');
					write(ans.first,' ');
					write(ans.second,'\n');
					flag=true;
					break;
				}
			}
			if(!flag)while(true);
		}
	}

return 0;
}