#include <bits/stdc++.h>
using namespace std;
int main(void) {
  long long q, a, b, m;
  cin >> q;
  while (q--) {
    cin >> a >> b >> m;
    if (a == b) {
      printf("1 %lld\n", a);
      continue;
    }
    int flag = 0;
    for (long long i = 1, j = 1; a * i + i * 1 <= b; i += i, j++) {
      if (a * i + i * 1 <= b && b <= a * i + i * m) {
        stack<long long> q;
        long long t1 = a * i, t2 = b - a * i;
        long long t3 = t2;
        vector<long long> r;
        long long t = i;
        while (t2) {
          if (t == 1) {
            r.push_back(t2);
            break;
          }
          t = t / 2;
          if (t2 <= t * m) {
            t2 -= t;
            r.push_back(1);
          } else {
            long long x = (t2 - t * m) / t;
            if (x * t < t2 - t * m) {
              x++;
            }
            t2 -= t * x;
            r.push_back(x);
          }
        }
        while (j--) {
          q.push(t1 + t3);
          t1 -= t1 / 2;
          t3 -= r[j];
          long long c = 1;
          for (int k = j - 2; k >= 0; k--) {
            t3 -= c * r[k];
            c *= 2;
          }
        }
        printf("%d ", (int)q.size() + 1);
        printf("%lld", a);
        while (!q.empty()) {
          printf(" %lld", q.top());
          q.pop();
        }
        printf("\n");
        flag = 1;
        break;
      }
    }
    if (!flag) cout << "-1" << '\n';
  }
  return 0;
}
