Problem: 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.

Input

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.

Output

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.

Examples

Input

0 0 0
0 0 1
0 0 1
0 0 1
0 1 1
0 1 1
0 1 1
1 1 1


Output

YES
0 0 0
0 0 1
0 1 0
1 0 0
0 1 1
1 0 1
1 1 0
1 1 1


Input

0 0 0
0 0 0
0 0 0
0 0 0
1 1 1
1 1 1
1 1 1
1 1 1


Output

NO

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long cross(long long *a, long long *b) {
  long long s = 0;
  for (int i = 0; i < 3; i++) s += a[i] * b[i];
  return s;
}
long long dis(long long *a) { return cross(a, a); }
int p[10][3], q[10][3];
int fg;
bool find(long long *a) {
  for (int i = 0; i < 8; i++) {
    if (a[0] == q[i][0] && a[1] == q[i][1] && a[2] == q[i][2]) return 1;
  }
  return 0;
}
bool check() {
  long long dx[3], dy[3], dz[3], a[3], b[3], c[3], d[3];
  for (int i = 1; i < 8; i++)
    for (int j = i + 1; j < 8; j++)
      for (int k = j + 1; k < 8; k++) {
        for (int l = 0; l < 3; l++) dx[l] = q[i][l] - q[0][l];
        for (int l = 0; l < 3; l++) dy[l] = q[j][l] - q[0][l];
        for (int l = 0; l < 3; l++) dz[l] = q[k][l] - q[0][l];
        if (dis(dx) != 0 && cross(dx, dy) == 0 && cross(dx, dz) == 0 &&
            cross(dy, dz) == 0 && dis(dx) == dis(dy) && dis(dy) == dis(dz)) {
          for (int l = 0; l < 3; l++) a[l] = q[0][l] + dx[l] + dy[l];
          for (int l = 0; l < 3; l++) b[l] = q[0][l] + dx[l] + dz[l];
          for (int l = 0; l < 3; l++) c[l] = q[0][l] + dy[l] + dz[l];
          for (int l = 0; l < 3; l++) d[l] = q[0][l] + dx[l] + dy[l] + dz[l];
          if (find(a) && find(b) && find(c) && find(d)) return 1;
        }
      }
  return 0;
}
void dfs(int u) {
  if (u >= 8) {
    if (check()) {
      puts("YES");
      for (int i = 0; i < 8; i++) {
        for (int j = 0; j < 3; j++) printf("%d ", q[i][j]);
        puts("");
      }
      throw 1;
    }
  } else {
    q[u][0] = p[u][0];
    q[u][1] = p[u][1];
    q[u][2] = p[u][2];
    dfs(u + 1);
    q[u][0] = p[u][0];
    q[u][1] = p[u][2];
    q[u][2] = p[u][1];
    dfs(u + 1);
    q[u][0] = p[u][1];
    q[u][1] = p[u][0];
    q[u][2] = p[u][2];
    dfs(u + 1);
    q[u][0] = p[u][1];
    q[u][1] = p[u][2];
    q[u][2] = p[u][0];
    dfs(u + 1);
    q[u][0] = p[u][2];
    q[u][1] = p[u][0];
    q[u][2] = p[u][1];
    dfs(u + 1);
    q[u][0] = p[u][2];
    q[u][1] = p[u][1];
    q[u][2] = p[u][0];
    dfs(u + 1);
  }
}
int main() {
  for (int i = 0; i < 8; i++)
    for (int j = 0; j < 3; j++) scanf("%d", &p[i][j]);
  for (int i = 0; i < 3; i++) q[0][i] = p[0][i];
  try {
    dfs(1);
  } catch (int e) {
    fg = 1;
  }
  if (!fg) puts("NO");
}