#include <bits/stdc++.h>
using namespace std;
long long pw[60];
long long a, b, m;
long long possible(long long in, long long fin, long long term) {
  if (term == 1) {
    if (in == fin)
      return 3;
    else
      return 2;
  }
  if (fin - in + 1 < term) {
    return 1;
  }
  long long baki = fin - pw[term - 2] * in;
  if ((baki > pw[term - 2] * m) || baki < pw[term - 2] || in > fin) {
    return 2;
  }
  return 3;
}
long long ajaira(long long mid, long long last, long long terms, long long sum,
                 long long koyta) {
  long long baki =
      last - pw[terms - koyta - 1] * sum - pw[terms - koyta - 2] * mid;
  if (baki > pw[terms - koyta - 2] * m) {
    return 1;
  } else if (baki < pw[terms - koyta - 2]) {
    return 2;
  } else {
    return 3;
  }
}
int main() {
  pw[0] = 1;
  for (long long i = 1; i < 59; i++) pw[i] = 2 * pw[i - 1];
  long long q;
  cin >> q;
  for (long long p = 1; p <= q; p++) {
    bool flag = false;
    cin >> a >> b >> m;
    if (a == b) {
      cout << 1 << ' ' << a << endl;
      continue;
    }
    for (long long k = 2; k <= 50; k++) {
      if (possible(a, b, k) == 3) {
        flag = true;
        long long ans[k];
        ans[0] = a;
        ans[k - 1] = b;
        long long sum = a;
        for (long long i = 1; i <= k - 2; i++) {
          long long low = 1;
          long long high = m;
          while (low <= high) {
            long long mid = (low + high) / 2;
            long long temp = ajaira(mid, b, k, sum, i);
            if (temp == 1) {
              low = mid + 1;
            } else if (temp == 2) {
              high = mid - 1;
            } else {
              if (ajaira(mid + 1, b, k, sum, i) != 3 || mid + 1 > m) {
                ans[i] = sum + mid;
                sum += ans[i];
                if (ans[i] > 100000000000000) {
                  flag = false;
                }
                break;
              } else {
                low = mid + 1;
              }
            }
          }
          if (ans[i] > 100000000000000) {
            flag = false;
          }
        }
        if (flag) {
          cout << k << ' ';
          for (long long i = 0; i < k; i++) {
            cout << ans[i] << ' ';
          }
          cout << endl;
          break;
        }
      }
    }
    if (!flag) {
      cout << -1 << endl;
      continue;
    }
  }
}
