#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;

void solve(){
	vector<double> x(6);
	vector<double> y(6);
	vector<double> theta(6);
	
	for(int i=0; i<6; i++){
		cin >> x[i] >> y[i];
		theta[i] = atan2( y[i], x[i] );
	}

	sort(theta.begin(), theta.end());

	double ans = (*upper_bound(theta.begin(), theta.end(), 0.0) - atan2(0, 1)) * 180 /  atan2(1e-18,-1);

	if(ans > 50) ans -= 60;

	printf("%.12f\n", ans);
}

int main(){
	int T;
	cin >> T;
	for(int t=0; t<T; t++){
		solve();
	}
	return 0;
}