#include<iostream>
using namespace std;
#define N 10000
int main()
{
	int R[N],G[N],B[N],flag=0;
	int D=0;
	int i=0,j=0,k=0;
	int temp;
	while (cin>>R[i]>>G[i]>>B[i],R[i]!=-1&&G[i]!=-1&&B[i]!=-1) 
	{
	//	
		j=i;
		if (j>=16)
		{ 
			D=(R[j]-R[0])*(R[j]-R[0])+(G[j]-G[0])*(G[j]-G[0])+(B[j]-B[0])*(B[j]-B[0]);	
			//flag=k;
			for (flag=k=0;k<16;k++)
			{
				temp=(R[j]-R[k])*(R[j]-R[k])+(G[j]-G[k])*(G[j]-G[k])+(B[j]-B[k])*(B[j]-B[k]);
				if (D>temp)
				{
				D=temp;
					flag=k;
				}
			}
			cout<<"("<<R[j]<<","<<G[j]<<","<<B[j]<<") maps to ("<<R[flag]<<","<<G[flag]<<","<<B[flag]<<")"<<endl;
		}	
		i++;
	}
	return 0;
}
终于好了，错在少了一个flag=k;