Given a positive integer m, we say that a sequence x_1, x_2, ..., x_n of positive integers is m-cute if for every index i such that 2 ≤ i ≤ n it holds that x_i = x_{i - 1} + x_{i - 2} + ... + x_1 + r_i for some positive integer r_i satisfying 1 ≤ r_i ≤ m.

You will be given q queries consisting of three positive integers a, b and m. For each query you must determine whether or not there exists an m-cute sequence whose first term is a and whose last term is b. If such a sequence exists, you must additionally find an example of it.

Input

The first line contains an integer number q (1 ≤ q ≤ 10^3) — the number of queries.

Each of the following q lines contains three integers a, b, and m (1 ≤ a, b, m ≤ 10^{14}, a ≤ b), describing a single query.

Output

For each query, if no m-cute sequence whose first term is a and whose last term is b exists, print -1.

Otherwise print an integer k (1 ≤ k ≤ 50), followed by k integers x_1, x_2, ..., x_k (1 ≤ x_i ≤ 10^{14}). These integers must satisfy x_1 = a, x_k = b, and that the sequence x_1, x_2, ..., x_k is m-cute.

It can be shown that under the problem constraints, for each query either no m-cute sequence exists, or there exists one with at most 50 terms.

If there are multiple possible sequences, you may print any of them.

Example

Input


2
5 26 2
3 9 1


Output


4 5 6 13 26
-1

Note

Consider the sample. In the first query, the sequence 5, 6, 13, 26 is valid since 6 = 5 + \bf{\color{blue} 1}, 13 = 6 + 5 + {\bf\color{blue} 2} and 26 = 13 + 6 + 5 + {\bf\color{blue} 2} have the bold values all between 1 and 2, so the sequence is 2-cute. Other valid sequences, such as 5, 7, 13, 26 are also accepted.

In the second query, the only possible 1-cute sequence starting at 3 is 3, 4, 8, 16, ..., which does not contain 9.
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int MAXN = 20010;
const int INF = 0x3f3f3f3f;
const double eps = 0.0000001;
const long long mod = 1e9 + 7;
long long n, m, x, y, z, k, cnt, t, len;
long long x1[50];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long a, b, q;
  cin >> q;
  while (q--) {
    cin >> a >> b >> m;
    long long p = 1;
    k = 2;
    while (b > p * (a + m)) {
      ++k;
      p <<= 1;
    }
    if (b >= p * (a + 1)) {
      cout << k << " ";
      x1[1] = a;
      x1[k] = b;
      int p = 1;
      for (int i = k - 1; i >= 2; i--) {
        if (x1[i + 1] % 2 == 0)
          x1[i] = x1[i + 1] >> 1;
        else {
          x1[i] = (x1[i + 1] + p) >> 1;
          p = -p;
        }
      }
      for (int i = 1; i <= k; i++) cout << x1[i] << " " << endl;
      cout << endl;
    } else if (a == b)
      cout << "1 " << a << endl;
    else
      cout << -1 << endl;
  }
  return 0;
}
