//2008E Dennis 
#include <iostream>
#include <algorithm>
using namespace std;

const int NEITHER=0;
const int FIRST=1;	
const int SECOND=2;
const int IDENTICAL=3;

struct box
{
	void set(int x,int y, int z)
	{
		dim[0]=x; dim[1]=y;	dim[2]=z;
		sort(dim,dim+3);	//sort dimensions to compare them nicely.
	}
	int compareBox(box b2)
	{
	         if (dim[0]==b2.dim[0] && dim[1]==b2.dim[1] && dim[2]==b2.dim[2]) return IDENTICAL;
		else if (dim[0]> b2.dim[0] && dim[1]> b2.dim[1] && dim[2]> b2.dim[2]) return SECOND;
		else if (dim[0]< b2.dim[0] && dim[1]< b2.dim[1] && dim[2]< b2.dim[2]) return FIRST;
		else return NEITHER;
	}
	int dim[3];	//dimensions:  x, y, z
};

int main()
{
	int n;
	int p[48];
	box b1,b2;
	int casenum=1;
	cin>>n;
	for (int c=0;c<n;c++) 
	{
		for (int i=0;i<48;i++) cin>>p[i];
		b1.set(p[3]-p[6],p[4]-p[1],p[23]-p[2]);		//isolate x, y, z dimensions for boxes
		b2.set(p[3+24]-p[6+24],p[4+24]-p[1+24],p[23+24]-p[2+24]);

		if (casenum>1) cout<<endl;					//separate test cases by blank line
		cout<<"Case "<<casenum++<<": ";

		switch(b1.compareBox(b2))
		{
		case IDENTICAL: cout<<"boxes are identical."<<endl;break;
		case SECOND:    cout<<"box 2 fits inside box 1."<<endl;break;
		case FIRST:     cout<<"box 1 fits inside box 2."<<endl;break;
		case NEITHER:   cout<<"neither box fits inside the other."<<endl;break;
		default: cout<<"ERROR"<<endl;
		}
	}

	return 0;
}


/*

2
6 5 1 6 8 1 4 8 1 4 5 1 6 5 9 6 8 9 4 8 9 4 5 9 6 6 7 6 9 7 5 9 7 5 6 7 6 6 8 6 9 8 5 9 8 5 6 8
2 0 0 2 2 0 0 2 0 0 0 0 2 0 2 2 2 2 0 2 2 0 0 2 2 0 0 2 2 0 0 2 0 0 0 0 2 0 2 2 2 2 0 2 2 0 0 2
*/


//How:  compute box dimensions, sort them, compare directly