CF464B.Restore Cube

Peter had a cube with non-zero length of a side. He put the cube into three-dimensional space in such a way that its vertices lay at integer points (it is possible that the cube's sides are not parallel to the coordinate axes). Then he took a piece of paper and wrote down eight lines, each containing three integers — coordinates of cube's vertex (a single line contains coordinates of a single vertex, each vertex is written exactly once), put the paper on the table and left. While Peter was away, his little brother Nick decided to play with the numbers on the paper. In one operation Nick could swap some numbers inside a single line (Nick didn't swap numbers from distinct lines). Nick could have performed any number of such operations.

When Peter returned and found out about Nick's mischief, he started recollecting the original coordinates. Help Peter restore the original position of the points or else state that this is impossible and the numbers were initially recorded incorrectly.

彼得有一个边长不为零的立方体。他将该立方体置于三维空间中，使得其八个顶点均位于整数坐标点上（立方体的棱不必与坐标轴平行）。接着，他取来一张纸，写下八行数字，每行包含三个整数——即立方体某一顶点的坐标（每行对应一个顶点，每个顶点恰好出现一次），然后将纸放在桌上离开了。

彼得离开期间，他的弟弟尼克决定玩弄纸上写的数字。每次操作中，尼克可在某一行内部任意交换该行中的数字（但不能跨行交换数字）。尼克可以执行任意多次此类操作。

当彼得返回并发现尼克的恶作剧后，他试图回忆这些顶点的原始坐标。请帮助彼得还原顶点的原始位置；若不可能还原，则说明初始记录有误。

Each of the eight lines contains three space-separated integers — the numbers written on the piece of paper after Nick's mischief. All numbers do not exceed 106 in their absolute value.

八行中的每一行都包含三个用空格分隔的整数——即 Nick 恶作剧后写在纸上的数字。所有数字的绝对值均不超过 $10^6$。

If there is a way to restore the cube, then print in the first line "YES". In each of the next eight lines print three integers — the restored coordinates of the points. The numbers in the i-th output line must be a permutation of the numbers in i-th input line. The numbers should represent the vertices of a cube with non-zero length of a side. If there are multiple possible ways, print any of them.

If there is no valid way, print "NO" (without the quotes) in the first line. Do not print anything else.

如果存在一种方法可以还原该立方体，则在第一行输出“YES”。接下来的八行中，每行输出三个整数——即还原后的各顶点坐标。第 $i$ 行输出的数字必须是第 $i$ 行输入数字的一个排列。这些数字应表示一个边长不为零的立方体的八个顶点。若存在多种可能的还原方式，输出任意一种即可。

如果不存在合法的还原方式，则在第一行输出“NO”（不带引号），且不得输出任何其他内容。