#include <bits/stdc++.h>
using namespace std;
long long x[100];
int main() {
  int t;
  long long a, b, m;
  cin >> t;
  while (t--) {
    cin >> a >> b >> m;
    if (a == b) {
      cout << 1 << ' ' << a << endl;
      continue;
    }
    long long p = 1;
    int k = 2;
    while (b > p * (a + m)) {
      k++;
      p *= 2;
    }
    if (b >= p * (a + 1)) {
      x[1] = a, x[k] = b;
      int p = -1;
      for (int i = k - 1; i >= 2; i--) {
        if (x[i + 1] % 2 == 0)
          x[i] = x[i + 1] / 2;
        else {
          x[i] = (x[i + 1] + p) / 2;
          p = -p;
        }
      }
      cout << k << ' ';
      for (int i = 1; i <= k; i++) cout << x[i] << ' ';
      cout << endl;
    } else
      cout << -1 << endl;
  }
  return 0;
}
