#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
unsigned long long arrmin[maxn];
int main() {
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    unsigned long long a, b, mod;
    cin >> a >> b >> mod;
    if (b - a <= mod) {
      if (a == b) {
        cout << "1 " << a << endl;
      } else
        cout << "2 " << a << " " << b << endl;
      continue;
    }
    unsigned long long arrmax;
    arrmin[0] = a;
    arrmin[1] = a + 1;
    arrmax = a + mod;
    int num = 2;
    for (num; 2 * arrmin[num - 1] <= b; num++) {
      arrmin[num] = 2 * arrmin[num - 1];
      arrmax = 2 * arrmax;
    }
    if (arrmax >= b || arrmax < arrmin[num - 1]) {
      cout << num << " ";
      for (int i = 1; i < num - 1; i++) {
        unsigned long long l = arrmin[i];
        unsigned long long r = arrmin[i] + mod - 1;
        unsigned long long base = 1;
        while (l < r) {
          unsigned long long m = (l + r) >> 1;
          unsigned long long tmp = (m - arrmin[i]) * (base << num - i - 2);
          if (b >= arrmin[num - 1] + tmp)
            l = m + 1;
          else
            r = m - 1;
        }
        if (b < arrmin[num - 1] + (l - arrmin[i]) * (base << num - i - 2)) l--;
        unsigned long long how = l - arrmin[i];
        arrmin[i] += how;
        unsigned long long sum = 0;
        for (int j = 0; j <= i; j++) sum += arrmin[j];
        for (int j = i + 1; j < num; j++) {
          arrmin[j] = sum + 1;
          sum += arrmin[j];
        }
      }
      for (int i = 0; i < num - 1; i++) cout << arrmin[i] << " ";
      cout << b << endl;
    } else
      cout << -1 << endl;
  }
  return 0;
}
