#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 50;
int q;
long long a, b, m;
long long val[60];
long long tmp[60];
bool isSat(int k) {
  if (k == 1) return true;
  memcpy(tmp + 1, val + 1, k * sizeof(long long));
  for (int i = 2; i <= k; ++i) {
    long long x = m - 1;
    tmp[i] -= x;
    for (int j = i + 1; j <= k; ++j) tmp[j] -= x, x += x;
    if (tmp[k] <= b) return true;
  }
  return false;
}
void Solve() {
  long long sum = a;
  long long k = 0;
  val[++k] = a;
  while (k <= 50) {
    if (val[k] >= b) break;
    val[++k] = sum + m;
    sum += val[k];
  }
  if (k > 50 || !isSat(k)) {
    printf("-1\n");
    return;
  }
  printf("%lld %lld", k, a);
  for (int i = 2; i < k; ++i) {
    long long d = val[k] - b;
    long long x = min(m - 1, d / (1ll * 1 << (k - i - 1)));
    val[i] -= x;
    for (int j = i + 1; j <= k; ++j) val[j] -= x, x += x;
    printf(" %lld", val[i]);
  }
  if (k > 1)
    printf(" %lld\n", b);
  else
    printf("\n");
}
int main() {
  scanf("%d", &q);
  while (q--) {
    scanf("%lld%lld%lld", &a, &b, &m);
    Solve();
  }
  return 0;
}
