#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
bool slove(int64 a, int64 b, int64 m, int k) {
  vector<int64> p(k);
  p[k - 2] = p[k - 1] = 1;
  for (int i = k - 3; ~i; i--) p[i] = p[i + 1] + p[i + 1];
  if (b / p[0] < a) return false;
  b -= a * p[0];
  for (int i = 1; i < k; i++) {
    if ((b -= p[i]) < 0) return false;
  }
  vector<int64> ans(k, 1);
  ans[0] = a;
  for (int i = 1; i < k; i++) {
    int64 t = min(b / p[i], m - 1);
    b -= t * p[i], ans[i] += t;
  }
  if (b != 0) return false;
  int64 sum = 0;
  for (int i = 0; i < k; i++) {
    ans[i] += sum;
    sum += ans[i];
  }
  printf("%d\n", (int)ans.size());
  for (int i = 0; i < k; i++) printf("%lld%c", ans[i], " \n"[i + 1 == k]);
  return true;
}
int main() {
  int T;
  for (scanf("%d", &T); T--;) {
    int64 a, b, m;
    scanf("%lld%lld%lld", &a, &b, &m);
    if (a == b) {
      printf("1 %lld\n", a);
      continue;
    }
    bool ok = false;
    for (int k = 2; k <= 50 && !ok; k++) ok |= slove(a, b, m, k);
    if (!ok) puts("-1");
  }
  return 0;
}
