#include <bits/stdc++.h>
using namespace std;
int q, n;
unsigned long long int a, b, m;
unsigned long long int sequence[50], sum;
int possible(int i, unsigned long long int r) {
  unsigned long long int minEnd = (1LL << (n - i - 2)) * (2 * sum + r + 1);
  unsigned long long int maxEnd = (1LL << (n - i - 2)) * (2 * sum + r + m);
  if (minEnd > b) return (-1);
  if (minEnd <= b && b <= maxEnd) return (1);
  return (0);
}
int main() {
  scanf("%d", &q);
  while (q--) {
    scanf("%lld %lld %lld", &a, &b, &m);
    bool can = false;
    for (n = 2; n <= 50 && !can; n++)
      can = (1LL << (n - 2)) * (a + 1) <= b && b <= (1LL << (n - 2)) * (a + m);
    n--;
    if (a == b)
      printf("1 %lld\n", a);
    else if (!can)
      printf("-1\n");
    else {
      sequence[0] = sum = a;
      sequence[n - 1] = b;
      for (int j = 1; j < n - 1; j++) {
        unsigned long long int lo = 1, hi = m;
        while (lo < hi) {
          unsigned long long int mid = ((lo + hi) >> 1) + 0 * ((lo + hi) & 1);
          int verdict = possible(j, mid);
          if (verdict == -1)
            hi = mid - 1;
          else if (verdict == 1)
            hi = mid;
          else
            lo = mid + 1;
        }
        sequence[j] = sum + lo;
        sum += sequence[j];
      }
      printf("%d", n);
      for (int i = 0; i < n; i++) printf(" %lld", sequence[i]);
      printf("\n");
    }
  }
  return (0);
}
