#include<iostream>

#include<cstdio>

#include<cmath>

#include<algorithm>

using namespace std;

struct node {

    double x, y, z;

    node(double a=, double b=, double c=) {

        x = a; y = b; z = c;

    }

    node operator + (const node &p) const { return node(x + p.x, y + p.y, z + p.z); }

    node operator - (const node &p) const { return node(x - p.x, y - p.y, z - p.z); }

    double operator * (const node &p) const { return x * p.x + y * p.y + z * p.z; }

    node operator ^ (const node &p) const { return node(y*p.z - z * p.y, z*p.x - x * p.z, x*p.y - y * p.x); }

    node operator * (double p) { return node(x*p, y*p, z*p); }

    node operator / (double p) { return node(x / p, y / p, z / p); }

}A1,B1,A2,B2,poa,pob;

double f(const node &a) { return sqrt(a.x*a.x + a.y*a.y + a.z*a.z); }

int main()

{

    int t;

    cin >> t;

    while (t--) {

        cin >> A1.x >> A1.y >> A1.z >> B1.x >> B1.y >> B1.z >> A2.x >> A2.y >> A2.z >> B2.x >> B2.y >> B2.z;

        node e1 = A1 - B1;

        node e2 = A2 - B2;

        node e3 = A1 - A2;

        node p = e1 ^ e2;

        double d = fabs((A1 - A2)*p / f(p));

        double t1 = ((A2 - A1) ^ e2)*(e1^e2);

        double t2 = ((A2 - A1) ^ e1)*(e1^e2);

        double q = f(e1^e2)*f(e1^e2);

        t1 /= q; t2 /= q;

        poa = A1 + (e1*t1);

        pob = A2 + (e2*t2);

        printf("%.6lf\n", d);

        printf("%.6lf %.6lf %.6lf %.6lf %.6lf %.6lf\n", poa.x, poa.y, poa.z, pob.x, pob.y, pob.z);

    }

    return ;

}