#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
double f(double n1, double c1, double s, double c2)
{
double fun;
fun = ((-(n1*n1*c1) + n1*(2*s + 6*c1) - 12*s)/n1) - c2;
return fun;
}
double fd(double n1, double c1, double s)
{
double fun;
fun = (-(n1*n1*c1) + 12*s - 12*n1)/(n1*n1);
return fun;
}
int main()
{
double f(double n1, double c1, double s, double c2);
double fd(double n1, double c1, double s);
long long int t;
scanf("%lld",&t);
long long int arr[t][3];
long long int a,n,d,i,j;
double c1,c2,s;
for (i=0;i<t;i++){
scanf("%lld%lld%lld",&arr[i][0],&arr[i][1],&arr[i][2]);
}
for (i=0;i<t;i++){
c1 = arr[i][0] + arr[i][1];
c2 = arr[i][1] - arr[i][0];
s = arr[i][2];
double d,x,x1;
x = 100;
do {
x1 = x - (f(x,c1,s,c2)/fd(x,c1,s));
if (x1 - x > 0.00000000) {
d = x1 - x;
} else {
d = x - x1;
}
x = x1;
} while (d > .000001);
n = int(x1);
d = c2 / (n-6);
a = arr[i][0] - 2*d;
long long int ap[n];
ap[0] = a;
for (j = 1; j < n; j++){
ap[j] = ap[j-1] + d;
}
printf("%lld\n",n);
for(j=0;j<n;j++){
printf(" %lld",ap[j]);
}
printf("\n");
}
return 0;
}
