#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define R cin>>
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
typedef pair<double,double> P;
typedef long double ld;

ld toDo(ld agl) {
  return agl*180.0/3.14159265358979323846264;
}

int main() {
  int T;
  R T;
  while(T--) {
    P a[6];
    rep(i,6) R a[i].F >> a[i].S;
    ld ans=MAXL;
    for(int i=0; i<6; i++) {
      ld d=atan2(a[i].S,a[i].F);
      if(d<-1e-9) continue;
      ans=min(ans,d);
    }
    printf("%.10Lf\n",toDo(ans));
  }
  return 0;
}