Problem: For given two segments s1 and s2, print the distance between them.

s1 is formed by end points p0 and p1, and s2 is formed by end points p2 and p3.

Constraints

* 1 ≤ q ≤ 1000
* -10000 ≤ xpi, ypi ≤ 10000
* p0 ≠ p1 and p2 ≠ p3.

Input

The entire input looks like:


q (the number of queries)
1st query
2nd query
...
qth query


Each query consists of integer coordinates of end points of s1 and s2 in the following format:


xp0 yp0 xp1 yp1 xp2 yp2 xp3 yp3


Output

For each query, print the distance. The output values should be in a decimal fraction with an error less than 0.00000001.

Example

Input

3
0 0 1 0 0 1 1 1
0 0 1 0 2 1 1 2
-1 0 1 0 0 1 0 -1


Output

1.0000000000
1.4142135624
0.0000000000

Solution (in CPP):

Solution:
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<climits>
#include<cstring>
#include<queue>
using namespace std;

const int INF = INT_MAX / 3;

#define REP(i,n) for(int i=0;i<(int)n;i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()


double EPS = 1e-10;

double add(double a, double b) {
	if (abs(a + b) < EPS * (abs(a) + abs(b))) return 0;
	return a + b;
}

struct P {
	double x, y;
	P() {}
	P(double x, double y) : x(x), y(y) {
	}
	P operator +(P p) {
		return P(add(x, p.x), add(y, p.y));
	}
	P operator -(P p) {
		return P(add(x, -p.x), add(y, -p.y));
	}
	P operator *(double d) {
		return P(d*x, d*y);
	}
	double dot(P p) {
		return add(x*p.x, y*p.y);
	}
	double det(P p) {
		return add(x*p.y, -y*p.x);
	}
	void print() {
		printf("%.10lf %.10lf \n", x, y);
		return;
	}
};

double dist(P &p, P &q, P &r){
	if((q-p).dot(r-p)*(p-q).dot(r-q) >= 0){
		double a = q.y-p.y;
		double b = -q.x+p.x;
		double c = -p.x*q.y+p.y*q.x;
		return fabs(a*r.x+b*r.y+c)/sqrt(a*a+b*b);
	}else{
		return min (sqrt((r.x-p.x)*(r.x-p.x)+(r.y-p.y)*(r.y-p.y)), sqrt((r.x-q.x)*(r.x-q.x)+(r.y-q.y)*(r.y-q.y)));
	}
	
}

P crossPoint(P p0, P p1, P p2, P p3){
	P q0 = p1-p0;
	P q1 = p3-p2;
	P r = p0 + (p1-p0)*((p3-p2).det(p2-p0)/(p3-p2).det(p1-p0));
	return r;
}

bool isCross(P &p0,P &p1,P &p2,P &p3){
	P r = crossPoint(p0, p1, p2, p3);
	return ((p1-p0).dot(r-p0) * (p0-p1).dot(r-p1)) >=0 && ((p3-p2).dot(r-p2) * (p2-p3).dot(r-p3)) >=0;;
}

double Distance(P &p0,P &p1,P &p2,P &p3){
	if(isCross(p0, p1, p2, p3)){
		return 0;
	}
	double d = dist(p0, p1, p2);
	d = min(d, dist(p0, p1, p3));
	d = min(d, dist(p2, p3, p0));
	d = min(d, dist(p2, p3, p1));
	return d;
}

int main(){
	int q;
	cin >> q ;
	REP(i,q){
		P p0, p1, p2, p3;
		cin >> p0.x >> p0.y >> p1.x >> p1.y >> p2.x >> p2.y >> p3.x >> p3.y ;
		printf("%.10lf \n", Distance(p0, p1, p2, p3));
	}
	return 0;
}