#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
const int MAXN = 1e5 + 10;
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) is >> *i;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++)
    os << *i << (i == end(v) - 1 ? "\n" : " ");
  return os;
}
signed main() {
  int t;
  cin >> t;
  while (t--) {
    ll a, b, m;
    cin >> a >> b >> m;
    if (a >= b) {
      if (a > b) cout << "-1" << '\n';
      if (a == b) cout << "1 " << a << '\n';
      continue;
    }
    int n;
    for (n = 1; n <= 50; ++n) {
      ll l = (1ll << (n - 1)) * (a + 1), r = (1ll << (n - 1)) * (a + m);
      if (b >= l && b <= r) break;
      if (l > b) {
        n = 51;
        break;
      }
    }
    if (n >= 50) {
      cout << "-1" << '\n';
      continue;
    }
    cout << n + 1 << " " << a << " ";
    ll sum = a, tot = 0;
    for (int i = 1; i < n; ++i) {
      ll r = min((b - (1ll << (n - 1)) - (1ll << (n - 1)) * a - tot) /
                     (1ll << (n - i - 1)),
                 m - 1);
      cout << sum + r + 1 << " ";
      tot += r * (1ll << (n - 1 - i));
      sum += (sum + r + 1);
    }
    cout << b << '\n';
  }
  return 0;
}
