#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize(4)
using namespace std;
int q;
long long a, b, m, p[55], d[55], sum[55];
int main() {
  scanf("%d", &q);
  sum[0] = p[0] = 1;
  for (int i = 1; i < 55; ++i) {
    if (i == 1)
      p[i] = 1, sum[i] = sum[i - 1] + p[i];
    else
      p[i] = p[i - 1] * 2, sum[i] = sum[i - 1] + p[i];
  }
  while (q--) {
    scanf("%lld %lld %lld", &a, &b, &m);
    bool f = false;
    if (a > b) {
      printf("-1\n");
      continue;
    }
    if (a == b) {
      printf("1 %lld\n", a);
      continue;
    }
    for (int i = 2; i <= 51; ++i) {
      long long l = a * p[i - 2], r = a * p[i - 2];
      long long tt = l;
      for (int j = i - 3; j >= 0; --j) {
        l += p[j];
        r += p[j] * m;
      }
      if (l > b) break;
      if (r < b) continue;
      for (int j = i - 3; j >= 0; --j) {
        if (j == 0) {
          if (b - tt <= m) d[0] = b - tt, f = true;
        } else {
          d[j] = (b - tt - sum[j - 1]) / p[j];
          d[j] = min(d[j], m);
          tt += d[j] * p[j];
        }
      }
      if (f) {
        vector<long long> vc;
        vc.push_back(a);
        long long s = a;
        for (int j = i - 3; j >= 0; --j) {
          long long t = s + d[j];
          s += t;
          vc.push_back(t);
        }
        printf("%d ", (int)vc.size());
        for (int i = 0; i < vc.size(); ++i)
          printf("%lld%c", vc[i], " \n"[i == vc.size() - 1]);
        break;
      }
    }
    if (!f) printf("-1\n");
  }
  return 0;
}
