#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000

using namespace std;
typedef long long ll;

int main(void) {
    int T;
    cin >> T;
    while (T--) {
        double x[6];
        double y[6];
        vector<int> candidate;
        for (int i = 0; i < 6; i++) {
            cin >> x[i] >> y[i];
            if (x[i] > 0 && y[i] > 0) candidate.push_back(i);
        }
        if (candidate.size() == 1) {
            double ans = acos(x[candidate[0]]);
            ans = ans / M_PI * 180;
            printf("%.10lf\n", ans);
        } else {
            int index = 0;
            if (x[candidate[0]] > x[candidate[1]]) index = 0;
            else index = 1;
            double ans = acos(x[candidate[index]]);
            ans = ans / M_PI * 180;
            printf("%.10lf\n", ans);
        }
    }
    return 0;
}