Problem: Recently a lot of students were enrolled in Berland State University. All students were divided into groups according to their education program. Some groups turned out to be too large to attend lessons in the same auditorium, so these groups should be divided into two subgroups. Your task is to help divide the first-year students of the computer science faculty.

There are t new groups belonging to this faculty. Students have to attend classes on three different subjects — maths, programming and P. E. All classes are held in different places according to the subject — maths classes are held in auditoriums, programming classes are held in computer labs, and P. E. classes are held in gyms.

Each group should be divided into two subgroups so that there is enough space in every auditorium, lab or gym for all students of the subgroup. For the first subgroup of the i-th group, maths classes are held in an auditorium with capacity of a_{i, 1} students; programming classes are held in a lab that accomodates up to b_{i, 1} students; and P. E. classes are held in a gym having enough place for c_{i, 1} students. Analogically, the auditorium, lab and gym for the second subgroup can accept no more than a_{i, 2}, b_{i, 2} and c_{i, 2} students, respectively.

As usual, some students skip some classes. Each student considers some number of subjects (from 0 to 3) to be useless — that means, he skips all classes on these subjects (and attends all other classes). This data is given to you as follows — the i-th group consists of:

  1. d_{i, 1} students which attend all classes; 
  2. d_{i, 2} students which attend all classes, except for P. E.; 
  3. d_{i, 3} students which attend all classes, except for programming; 
  4. d_{i, 4} students which attend only maths classes; 
  5. d_{i, 5} students which attend all classes, except for maths; 
  6. d_{i, 6} students which attend only programming classes; 
  7. d_{i, 7} students which attend only P. E. 



There is one more type of students — those who don't attend any classes at all (but they, obviously, don't need any place in auditoriums, labs or gyms, so the number of those students is insignificant in this problem).

Your task is to divide each group into two subgroups so that every auditorium (or lab, or gym) assigned to each subgroup has enough place for all students from this subgroup attending the corresponding classes (if it is possible). Each student of the i-th group should belong to exactly one subgroup of the i-th group; it is forbidden to move students between groups.

Input

The first line contains one integer t (1 ≤ t ≤ 300) — the number of groups.

Then the descriptions of groups follow. The description of the i-th group consists of three lines:

  * the first line contains three integers a_{i, 1}, b_{i, 1} and c_{i, 1} (1 ≤ a_{i, 1}, b_{i, 1}, c_{i, 1} ≤ 3000) — the capacity of the auditorium, lab and gym assigned to the first subgroup of the i-th group, respectively; 
  * the second line contains three integers a_{i, 2}, b_{i, 2} and c_{i, 2} (1 ≤ a_{i, 2}, b_{i, 2}, c_{i, 2} ≤ 3000) — the capacity of the auditorium, lab and gym assigned to the second subgroup of the i-th group, respectively; 
  * the third line contains integers d_{i, 1}, d_{i, 2}, ..., d_{i, 7} (0 ≤ d_{i, j} ≤ 3000) — the number of students belonging to each of the seven aforementioned types in the i-th group. It is not guaranteed that the sum of these values is positive — a group can consist entirely of students that don't attend classes at all. 



It is guaranteed that the total number of students in all groups is not greater than 3000.

Output

For each group, print the result of its division as follows:

  * if it is impossible to divide the group, print one integer -1; 
  * otherwise print seven integers f_{i, 1}, f_{i, 2}, ..., f_{i, 7} (0 ≤ f_{i, j} ≤ d_{i, j}) — the number of students the first, second, ..., seventh type in the first subgroup of the i-th group (all other students will be assigned to the second subgroup). If there are multiple answers, print any of them. 

Example

Input


3
9 4 13
1 10 3
1 2 3 4 5 6 7
9 4 13
1 10 3
2 1 3 4 5 6 7
1 2 3
4 5 6
0 0 0 0 0 0 0


Output


1 1 3 4 2 0 7
-1
0 0 0 0 0 0 0

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
long long gi() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) f ^= ch == '-', ch = getchar();
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return f ? x : -x;
}
std::mt19937 rnd(time(NULL));
template <class T>
void cxk(T& a, T b) {
  a = a > b ? a : b;
}
template <class T>
void cnk(T& a, T b) {
  a = a < b ? a : b;
}
int A[2][3], B[8], C[3];
int main() {
  int qwq = gi();
  while (qwq--) {
    for (int i = 0; i < 2; ++i)
      for (int j = 2; ~j; --j) A[i][j] = gi();
    for (int j = 7; j; --j) B[j] = gi();
    int s = 0;
    for (int i = 1; i <= 7; ++i)
      if (i != (i & -i)) s += B[i];
    for (int i = 0; i < 3; ++i) {
      int sum = A[0][i] + A[1][i];
      for (int j = 1; j <= 7; ++j)
        if (j >> i & 1) sum -= B[j];
      if (sum < 0) {
        puts("-1");
        goto ed;
      }
    }
    for (int i = 0; i < 3; ++i) C[i] = B[7 ^ (1 << i)];
    for (int a = 0, b = s; a <= s; ++a, --b) {
      bool flg = 0;
      for (int i = 0; i < 3; ++i)
        if (std::max(0, a - A[0][i]) + std::max(0, b - A[1][i]) > C[i]) flg = 1;
      if (a < std::max(0, a - A[0][0]) + std::max(0, a - A[0][1]) +
                  std::max(0, a - A[0][2]))
        flg = 1;
      if (b < std::max(0, b - A[1][0]) + std::max(0, b - A[1][1]) +
                  std::max(0, b - A[1][2]))
        flg = 1;
      if (flg) continue;
      int D[8] = {0};
      D[7] = a;
      for (int i = 0; i < 3; ++i) {
        int p = std::max(0, a - A[0][i]);
        D[7 ^ (1 << i)] = p;
        D[7] -= p;
      }
      for (int i = 0; i < 3; ++i) {
        int p = std::max(
            0, std::min({D[7] - B[7], B[7 ^ (1 << i)] - D[7 ^ (1 << i)],
                         C[i] - D[7 ^ (1 << i)] - std::max(0, b - A[1][i])}));
        D[7 ^ (1 << i)] += p;
        D[7] -= p;
      }
      for (int i = 0; i < 3; ++i) {
        int s = A[0][i];
        for (int j = 1; j <= 7; ++j)
          if (j >> i & 1) s -= D[j];
        D[1 << i] = std::min(s, B[1 << i]);
      }
      for (int i = 7; i; --i) printf("%d ", D[i]);
      puts("");
      for (int i = 1; i <= 7; ++i) assert(D[i] <= B[i]);
      for (int i = 0; i < 3; ++i) {
        int s1 = 0, s2 = 0;
        for (int j = 1; j <= 7; ++j)
          if (j >> i & 1) s1 += D[j], s2 += B[j] - D[j];
        assert(s1 <= A[0][i] && s2 <= A[1][i]);
      }
      goto ed;
    }
    puts("-1");
  ed:;
  }
  return 0;
}