#include <bits/stdc++.h>
using namespace std;
long long pow(int k) {
  if (k == -1) {
    return 1;
  } else if (k >= 0) {
    return 1LL << k;
  } else {
    return 0;
  }
}
bool solve(long long A, long long B, long long M, int k) {
  if (k >= 3 && ((B >> (k - 2)) > A + M || (B >> (k - 2)) < A + 1)) {
    return false;
  }
  long long lb = (A + 1) * pow(k - 2);
  long long ub = (A + M) * pow(k - 2);
  if (lb <= B && ub >= B) {
    long long over = B - lb;
    vector<long long> add(k - 1, 1);
    for (int j = 0; j < k - 1; ++j) {
      long long d = min(over / pow(k - 3 - j), M - 1);
      add[j] += d;
      over -= d * pow(k - 3 - j);
    }
    printf("%d %lld", k, A);
    for (int j = 0; j < k - 1; ++j) {
      printf(" %lld", A + add[j]);
      A += A + add[j];
    }
    printf("\n");
    return true;
  } else {
    return false;
  }
}
int main() {
  int Q;
  scanf("%d", &Q);
  for (int q = 0; q < Q; ++q) {
    long long A, B, M;
    scanf("%lld%lld%lld", &A, &B, &M);
    if (A == B) {
      printf("1 %lld\n", A);
      continue;
    }
    bool solved = false;
    for (int k = 2; k <= 50; ++k) {
      if (solve(A, B, M, k)) {
        solved = true;
        break;
      }
    }
    if (!solved) {
      printf("-1\n");
    }
  }
  return 0;
}
