//Accepted 00.00.00 392K
#include <math.h>
#include <stdio.h>
int dblcmp(double d)
{
if(fabs(d) < 1e-7) return 0 ;
else return (d > 0) ? 1 : -1 ;
}
double distance(double x1, double y1, double x2, double y2)
{
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
bool solve()
{
double cx1, cy1, r1, cx2, cy2, r2;
scanf("%lf%lf%lf", &cx1, &cy1, & r1);
scanf("%lf%lf%lf", &cx2, &cy2, & r2);
double dis = distance(cx1, cy1, cx2, cy2);
if(dblcmp(r1 - r2) == 0 ||
dblcmp(dis - fabs(r1 - r2)) <= 0 )
return false ;
double y = (r1 * cy2 - r2 * cy1) / (r1 - r2);
double x = (r1 * cx2 - r2 * cx1) / (r1 - r2);
printf("%.2lf %.2lf/n" , x, y);
return true ;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("1199.txt", "r" , stdin);
#endif
int t;
while(scanf("%d", &t) != EOF)
while(t-- )
if(!solve()) printf("Impossible./n" );
#ifndef ONLINE_JUDGE
fclose(stdin);
#endif
return 0 ;
}
#include <stdio.h>
int dblcmp(double d)
{
if(fabs(d) < 1e-7) return 0 ;
else return (d > 0) ? 1 : -1 ;
}
double distance(double x1, double y1, double x2, double y2)
{
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
bool solve()
{
double cx1, cy1, r1, cx2, cy2, r2;
scanf("%lf%lf%lf", &cx1, &cy1, & r1);
scanf("%lf%lf%lf", &cx2, &cy2, & r2);
double dis = distance(cx1, cy1, cx2, cy2);
if(dblcmp(r1 - r2) == 0 ||
dblcmp(dis - fabs(r1 - r2)) <= 0 )
return false ;
double y = (r1 * cy2 - r2 * cy1) / (r1 - r2);
double x = (r1 * cx2 - r2 * cx1) / (r1 - r2);
printf("%.2lf %.2lf/n" , x, y);
return true ;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("1199.txt", "r" , stdin);
#endif
int t;
while(scanf("%d", &t) != EOF)
while(t-- )
if(!solve()) printf("Impossible./n" );
#ifndef ONLINE_JUDGE
fclose(stdin);
#endif
return 0 ;
}