#include <bits/stdc++.h>
using namespace std;
void soln() {
  long long int a, b, m;
  cin >> a >> b >> m;
  if (a == b) {
    cout << 1 << " " << a << endl;
    return;
  }
  if (a + m >= b) {
    cout << 2 << " " << a << " " << b << endl;
    return;
  }
  long long int ans = a;
  long long int count = 1;
  long long int sum = a;
  while (1) {
    ans += m;
    count++;
    if (ans >= b) break;
    sum += ans;
    ans = sum;
  }
  vector<long long int> v1;
  long long int l = count - 1;
  long long int p = 1;
  for (int i = 1; i < l; i++) {
    p *= 2;
  }
  long long int x = b - p * a;
  long long int m1 = x / p;
  if (m1 < 1) {
    cout << -1 << endl;
    return;
  }
  v1.push_back(a);
  ans = a;
  sum = a;
  for (int i = 1; i <= l; i++) {
    ans += m1;
    v1.push_back(ans);
    sum += ans;
    ans = sum;
  }
  long long int limit = b - v1[v1.size() - 1];
  vector<long long int> v2;
  while (limit > 0) {
    v2.push_back(limit % 2);
    limit /= 2;
  }
  for (int i = v2.size(); i < v1.size() - 1; i++) {
    v2.push_back(0);
  }
  reverse(v2.begin(), v2.end());
  v2.push_back(0);
  long long int cnt = 0;
  long long int s = 0, c = 0, prev = 0;
  for (int i = 0; i < v1.size(); i++) {
    v1[i] += (2 * s);
    v1[i] += prev;
    s *= 2;
    if (prev == 1) {
      s++;
      prev = 0;
    }
    if (v2[i] == 1) prev = 1;
    v1[i] += prev;
  }
  cout << v1.size() << " ";
  for (int i = 0; i < v1.size(); i++) {
    cout << v1[i] << " ";
  }
  cout << endl;
}
int main() {
  long long int q;
  cin >> q;
  while (q--) {
    soln();
  }
}
