#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int i, j;
  long long int n, k;
  int test;
  cin >> test;
  while (test--) {
    long long int a, b, m;
    cin >> a >> b >> m;
    vector<pair<long long int, long long int> > v;
    v.push_back({a, a});
    k = 1;
    long long int fs = a, ss = a;
    while (k <= 49) {
      if ((fs + 1) > b) break;
      v.push_back({fs + 1, ss + m});
      fs = 2 * fs + 1;
      ss = 2 * ss + m;
      k++;
    }
    if (a == b) {
      cout << 1 << " " << a << "\n";
      continue;
    }
    if ((a + m) >= b) {
      cout << 2 << " " << a << " " << b << "\n";
      continue;
    }
    int check = 0;
    for (i = 0; i < v.size(); i++) {
      if (v[i].second >= b && b >= v[i].first) {
        check = 1;
        break;
      }
    }
    if (check == 0)
      cout << "-1\n";
    else {
      long long int fm, fl = v.size();
      fm = (b - (pow(2, fl - 2) * a)) * 1.00 / (pow(2, fl - 2));
      long long int diff = b - pow(2, fl - 2) * (a)-pow(2, fl - 2) * (fm);
      vector<long long int> ans, bit, ps(fl + 10, 0);
      while (diff != 0) {
        bit.push_back(diff % 2);
        diff = diff / 2;
      }
      long long int sb = bit.size();
      for (i = 1; i <= (fl - 1 - sb); i++) bit.push_back(0);
      reverse(bit.begin(), bit.end());
      for (i = 1; i <= 50; i++) bit.push_back(0);
      ps[0] = a + bit[0];
      ans.push_back(a + bit[0]);
      k = 1;
      long long int fs = a + bit[0];
      for (i = 1; i <= fl - 1; i++) {
        ans.push_back(fs + fm + bit[i]);
        ps[i] = ps[i - 1] + ans[i];
        fs = ans[i] + ps[i - 1];
        k++;
      }
      cout << ans.size() << " ";
      for (i = 0; i < ans.size(); i++) {
        cout << ans[i] << " ";
      }
      cout << "\n";
    }
  }
  return 0;
}
