#include <bits/stdc++.h>
using namespace std;
const int M = 998244353;
int n;
int bin_search_upper(int tar, vector<int>& a) {
  int lo = 0, hi = n - 1;
  int mid = (lo + hi + 1) >> 1;
  while (lo < hi) {
    mid = (lo + hi + 1) >> 1;
    if (a[mid] == tar)
      return mid;
    else if (a[mid] < tar)
      lo = mid;
    else
      hi = mid - 1;
  }
  return lo;
}
int bin_search_lower(int tar, vector<int>& a) {
  int lo = 0, hi = n - 1;
  int mid = (lo + hi) >> 1;
  while (lo < hi) {
    mid = (lo + hi) >> 1;
    if (a[mid] == tar)
      return mid;
    else if (a[mid] < tar)
      lo = mid + 1;
    else
      hi = mid;
  }
  return lo;
}
int main() {
  int q;
  cin >> q;
  while (q--) {
    long long int a, b_, m;
    cin >> a >> b_ >> m;
    if (a == b_) {
      cout << "1 " << a << "\n";
      continue;
    }
    bool flag = false;
    vector<long long int> cnt;
    for (int k = 2; k <= 50; ++k) {
      cnt.clear();
      long long int b = b_;
      long long int p = 1LL << k - 2;
      if (a * p >= b) break;
      b -= a * p;
      cnt.push_back(a);
      if (b < p) continue;
      b -= p;
      p >>= 1;
      while (p >= 1) {
        long long int j = b / p;
        if (j > m - 1) j = m - 1;
        b -= p * j;
        cnt.push_back(j + 1);
        p >>= 1;
      }
      if (b > m - 1) continue;
      cnt.push_back(b + 1);
      flag = true;
      break;
    }
    if (flag) {
      long long int sum = a;
      for (int i = 1; i < cnt.size(); ++i) {
        cnt[i] += sum;
        sum += cnt[i];
      }
      cout << cnt.size();
      for (int i = 0; i < cnt.size(); ++i) cout << " " << cnt[i];
      cout << "\n";
    } else
      cout << "-1\n";
  }
}
