#include<stdio.h>

#include<iostream>

#include<string.h>

#include<algorithm>

#include<cmath>

#include<vector>

#include<queue>

#include<set>

using namespace std;

#define met(a, b) memset(a, b, sizeof(a))

#define maxn 10005

#define maxm 20005

#define INF 0x3f3f3f3f

typedef long long LL;

int main()

{

    int T, tcase = ;

    scanf("%d", &T);

    while(T --)

    {

        double b, c, d, ax, ay, bx, by;

        scanf("%lf %lf %lf %lf %lf %lf %lf", &ax, &ay, &bx, &by, &b, &c, &d);

        double a = sqrt((ax-bx)*(ax-bx) + (ay-by)*(ay-by));///直线AB的距离；

        double sina = (by-ay) / a;

        double cosa = (bx-ax) / a;

        ///AB与水平线的sin和cos值；

        double p = (b+d+a-c)/;

        double s = sqrt(p*(p-b)*(p-d)*(p-(a-c)));

        double h = s*/(a-c);///D到AB的距离；

        int flag = ;

        if(b*b > d*d + (a-c)*(a-c)) flag = ;///角DAB为钝角;

        double t = sqrt(fabs(d*d - h*h));

        if(flag) t = -t;

        double dx = ax + (t*cosa - h*sina);

        double dy = ay + (h*cosa + t*sina);

        double cx = dx + c*cosa;

        double cy = dy + c*sina;

        printf("Case %d:\n%.8lf %.8lf %.8lf %.8lf\n", tcase++, cx, cy, dx, dy);

    }

    return ;

}