#include <bits/stdc++.h>
using namespace std;
void fun() {}
long long int md = 998244353;
long long int __gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return __gcd(b, a % b);
}
long long int poww(long long int a, long long int b, long long int md) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  long long int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a) % md;
    }
    a = (1ll * a * a) % md;
    b >>= 1;
  }
  return res;
}
long long int poww(long long int a, long long int b) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  long long int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a);
    }
    a = (1ll * a * a);
    b >>= 1;
  }
  return res;
}
void ainp(long long int arr[], long long int n) {
  for (long long int i = 1; i <= n; i++) cin >> arr[i];
}
long long int divide(long long int a, long long int b, long long int md) {
  long long int rr = a * (poww(b, md - 2, md));
  rr %= md;
  return rr;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  fun();
  long long int q;
  cin >> q;
  while (q--) {
    long long int a, b, m;
    cin >> a >> b >> m;
    if (a == b) {
      cout << "1 " << a << "\n";
      continue;
    }
    long long int lows[51], highs[51], ph[51], pl[51];
    highs[0] = lows[0] = ph[0] = pl[0] = a;
    long long int i = 0;
    long long int fg = 0;
    while (lows[i] < b) {
      lows[i + 1] = pl[i] + 1;
      highs[i + 1] = ph[i] + m;
      pl[i + 1] = pl[i] + lows[i + 1];
      ph[i + 1] = ph[i] + highs[i + 1];
      i++;
      if (lows[i] <= b && highs[i] >= b) {
        fg = 1;
        break;
      }
    }
    if (!fg) {
      cout << "-1\n";
      continue;
    }
    long long int ans[i + 1];
    ans[i] = b;
    long long int vv = 1ll << (i - 1);
    long long int lowsum = vv * a + vv - 1;
    ans[i - 1] = max(lowsum, b - m);
    for (long long int j = i - 2; j >= 0; j--) {
      long long int val = ceil((ans[j + 1] - m) / 2.0);
      vv = 1ll << (j);
      lowsum = vv * a + vv - 1;
      ans[j] = max(lowsum, val);
      ans[j + 1] -= ans[j];
    }
    cout << i + 1 << " ";
    long long int sum = 0;
    for (long long int j = 0; j <= i; j++) cout << ans[j] << " ";
    cout << "\n";
  }
  return 0;
}
