#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstring>

#include<cmath>

using namespace std;

typedef long long ll;

inline int read()

{

    int x=,f=; char ch=getchar();

    while(ch<''||ch>'') { if(ch=='-') f=-; ch=getchar(); }

    while(ch>=''&&ch<='') { x=(x<<)+(x<<)+(ch^); ch=getchar(); }

    return x*f;

}

const int N=2e5+;

int Q,n;

int main()

{

    Q=read();

    while(Q--)

    {

        n=read(); int xa,ya,xb=-,yb=-,xc=,yc=;

        for(int i=;i<=n;i++)

        {

            xa=read(),ya=read();

            if(!read()) xb=max(xb,xa);

            if(!read()) yc=min(yc,ya);

            if(!read()) xc=min(xc,xa);

            if(!read()) yb=max(yb,ya);

        }

        if(xb>xc||yb>yc) { printf("0\n"); continue; }

        printf("1 %d %d\n",xb,yb);

    }

    return ;

}