#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int MAXN(2e5 + 100);
int n;
LL a, b, m;
inline int read() {
  int f = 1, x = 0;
  char ch;
  do {
    ch = getchar();
    if (ch == '-') f = -1;
  } while (ch < '0' || ch > '9');
  do {
    x = x * 10 + ch - '0';
    ch = getchar();
  } while (ch >= '0' && ch <= '9');
  return f * x;
}
LL binsearch(LL c, LL target) {
  LL l = 1, r = m;
  while (l < r) {
    LL mid = (l + r) >> 1;
    if (c * mid <= target)
      l = mid + 1;
    else
      r = mid;
  }
  return l - 1;
}
void init() { scanf("%I64d%I64d%I64d", &a, &b, &m); }
void solve() {
  if (a == b) {
    printf("1 %I64d\n", a);
    return;
  }
  LL low = a + 1, up = a + m;
  n = 2;
  while (n <= 50 && low <= b) {
    if (low <= b && b <= up) break;
    low <<= 1;
    up <<= 1;
    n++;
  }
  if (n > 50 || low > b)
    printf("-1\n");
  else {
    LL rem = b - (1LL << (n - 2)) * a;
    for (int i = n - 3; i >= 0; i--) rem -= (1LL << i);
    rem -= 1LL;
    vector<LL> r;
    for (int i = n - 3; i >= 0; i--) {
      LL tmp = binsearch(1LL << i, rem);
      rem -= (1LL << i) * tmp;
      r.push_back(tmp + 1);
    }
    r.push_back(rem + 1);
    printf("%d %I64d ", n, a);
    LL x = a + r[0];
    for (int i = 2; i <= n; i++) {
      printf("%I64d%c", x, i < n ? ' ' : '\n');
      if (i < n) x = 2 * x + r[i - 1] - r[i - 2];
    }
  }
}
int main() {
  int t = read();
  while (t--) {
    init();
    solve();
  }
}
