#include <bits/stdc++.h>
using namespace std;
const long long maxx = 1e14;
long long q, a, b, m;
long long f[50];
long long rr[59];
int main() {
  f[0] = 1;
  for (int i = 1; i <= 50; i++) f[i] = f[i - 1] * 2;
  cin >> q;
  while (q--) {
    cin >> a >> b >> m;
    if (b > maxx) {
      cout << -1 << endl;
      continue;
    }
    if (b == a) {
      cout << 1 << " " << a << endl;
      continue;
    } else {
      bool flag = 1;
      for (int k = 2; k <= 50; k++) {
        memset(rr, 0, sizeof(rr));
        long long t = b - f[k - 2] * a;
        long long ty = f[k - 2];
        if (t < 0) break;
        if (t >= ty && t <= ty * m) {
          long long tt = t / ty;
          long long y = t % ty;
          for (int i = 2; i <= k; i++) rr[i] = tt;
          for (int i = k - 3; i >= 0; i--)
            if (y >> i && (k - i - 1 >= 2)) rr[k - i - 1]++, y -= (1ll << i);
          cout << k << " " << a;
          for (int i = 2; i <= k; i++) {
            long long sum = rr[i];
            for (int j = 2; j <= i - 1; j++) sum = sum + rr[j] * f[i - j - 1];
            cout << " " << f[i - 2] * a + sum;
          }
          cout << endl;
          flag = 0;
          break;
        }
      }
      if (flag) cout << -1 << endl;
    }
  }
  return 0;
}
