#include <bits/stdc++.h>
using namespace std;
const long long N = 51;
long long a, b, m;
long long ans[N];
void add(long long i, long long x, long long &b, long long len) {
  ans[i] += x;
  if (i == len - 1) b -= x;
  for (long long j = i + 1; j < len; ++j) {
    ans[j] += x;
    if (j == len - 1) b -= x;
    x <<= 1;
  }
}
void print(long long len) {
  if (len == 1) {
    cout << "1 " << a << '\n';
    return;
  }
  for (long long i = 0; i < N; ++i) ans[i] = 0;
  add(0, a, b, len);
  for (long long i = 1; i < len; ++i) add(i, 1, b, len);
  for (long long i = 1; i < len; ++i) {
    long long k = 1;
    if (i < len - 1) k <<= len - 2 - i;
    add(i, min(m - 1, b / k), b, len);
  }
  cout << len << ' ';
  for (long long i = 0; i < len; ++i) cout << ans[i] << ' ';
  cout << '\n';
}
long long l[N], r[N];
void solve() {
  cin >> a >> b >> m;
  l[0] = r[0] = a;
  long long lsum = a, rsum = a;
  for (long long i = 1; i < N; ++i) {
    l[i] = lsum + 1;
    r[i] = rsum + m;
    lsum += l[i];
    rsum += r[i];
  }
  for (long long i = 0; i < N; ++i) {
    if (l[i] > b) {
      cout << "-1\n";
      return;
    }
    if (l[i] <= b && b <= r[i]) {
      print(i + 1);
      return;
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long q;
  cin >> q;
  while (q--) {
    solve();
  }
}
