#include <bits/stdc++.h>
using namespace std;
const long long N = 1e2 + 10;
const long long mod = 1e9 + 7;
long long q;
long long a, b, m;
long long ans[N], sum, last;
vector<pair<long long, long long> > v;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> q;
  for (long long o = 1; o <= q; ++o) {
    cin >> a >> b >> m;
    ans[1] = a;
    sum = a;
    last = 0;
    for (long long i = 2; i <= 50; ++i) {
      ans[i] = sum + 1;
      sum += ans[i];
      if (ans[i] > b) {
        last = i - 1;
        break;
      }
    }
    if (last == 0) {
      cout << -1 << endl;
      continue;
    }
    v.clear();
    long long temp = 0;
    for (long long i = 2; i < last; ++i) {
      ans[i] += min(m - 1, (b - ans[last]) / (long long)pow(2, last - i - 1));
      for (auto t : v) {
        ans[i] += ((long long)pow(2, i - t.second - 1)) * (t.first);
      }
      v.push_back(
          {min(m - 1, (b - ans[last]) / (long long)pow(2, last - i - 1)), i});
      ans[last] +=
          min(m - 1, (b - ans[last]) / (long long)pow(2, last - i - 1)) *
          (long long)pow(2, last - i - 1);
    }
    if (b - ans[last] > m - 1) {
      cout << -1 << endl;
      continue;
    }
    ans[last] = b;
    cout << last << ' ';
    for (long long i = 1; i <= last; ++i) {
      cout << ans[i] << ' ';
    }
    cout << endl;
  }
  return 0;
}
