#include <iostream>
using namespace std;
#include <math.h>
int a[16][3];
int b[3],c[3];
long double d[16];
int i,j;
double findD(int p[16][3],int q[3],int i1)
{
	long double t=(long double)((p[i1][0]-q[0])*(p[i1][0]-q[0])+(p[i1][1]-q[1])*(p[i1][1]-q[1])+(p[i1][2]-q[2])*(p[i1][2]-q[2]));
	long double D;
	D=(long double) sqrt(t);
	return D;
}

void main()
{
	long double min=0;
	for(i=0;i<16;i++)
		for(j=0;j<3;j++)
			cin>>a[i][j];
	while(1)
	{
		cin>>b[0]>>b[1]>>b[2];
		if(b[1]==-1&&b[0]==-1&&b[2]==-1)
			break;
		for(i=0;i<16;i++)
		{
			d[i]=findD(a,b,i);
		}
		min=d[0];
		for(i=1;i<16;i++)
		{
			if(min>d[i])
			{
				min=d[i];
				for(j=0;j<3;j++)
					c[j]=a[i][j];
			}
				
		}
		cout<<"("<<b[0]<<","<<b[1]<<","<<b[2]<<")"<<" maps to "<<"("<<c[0]<<","<<c[1]<<","<<c[2]<<")"<<endl;
	}
	return;
}