#include<iostream>
#include<vector>
#include<complex>
#include<algorithm>
#include<cmath>
using namespace std;

#define EPS (1e-6)
#define EQ(a,b) (abs((a)-(b)) < EPS)
#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))
typedef complex<double> Po;

Po unit(Po p){return p / abs(p);}
  
Po normal(Po p,int m){
  Po x;
  if(!m)x = p * Po(0,1);
  else x = p * Po(0,-1);
  return x;
}

double dot(Po x,Po y){return x.real()*y.real() + x.imag()*y.imag();}

double cross(Po x,Po y){return x.real()*y.imag() - x.imag()*y.real();}

double area(Po a,Po b,Po c){
  return abs(cross(b-a,c-a)/2);
}

double heron(Po a,Po b,Po c){
  double l1,l2,l3,s;
  l1 = abs(a-b);
  l2 = abs(b-c);
  l3 = abs(c-a);
  s = (l1+l2+l3)/2;
  return sqrt(s*(s-l1)*(s-l2)*(s-l3));
}

bool inter(Po a,Po b,Po c,Po x){
  if( heron(a,b,x) + heron(b,c,x) + heron(c,a,x) > heron(a,b,c) +EPS)return false;
  else return true;
}

class line{
 public:
  Po a,b;

  void set(Po x,Po y){
    a = x;
    b = y;
  }

  bool orth(line l){
    return EQ( dot(a-b,l.a-l.b),0.0);
  }

  bool para(line l){
    return EQ( cross(a-b,l.a-l.b),0.0);
  }

  bool on_line(Po x){
    return EQ( cross(b-a,x-a),0.0);
  }

  double line_dis(Po x){
    return abs(cross(b-a,x-a))/abs(b-a);
  }

  Po line_cp(line l){
    return a + (b-a)*cross(l.b-l.a,l.a-a) /cross(l.b-l.a,b-a);
  }

  bool on_seg(Po x){
    return (abs(a-x) + abs(x-b) < abs(a-b) + EPS);
  }

  double seg_dis(Po x){
    if(dot(b-a,x-a)<EPS)return abs(x-a);
    if(dot(a-b,x-b)<EPS)return abs(x-b);
    return abs(cross(b-a,x-a))/abs(b-a);
  }

  int is_cross(line l){
    return (cross(b-a,l.a-a) * cross(b-a,l.b-a)<EPS) && (cross(l.b-l.a,a-l.a) * cross(l.b-l.a,b-l.a) < EPS);
  }

  Po seg_cp(line l){
    double d = abs(cross(l.b-l.a,a-l.a));
    return a + (b-a)*( d / (d * abs(cross(l.b-l.a,b-l.a))));
  }
};

class polygon{
 public:
  vector<Po> v;
  int o;

  void set(void){
    v.clear();
  }

  void Vadd(Po a){
    if(!v.size())o = 0;
    else if(a.imag() < v[o].imag())o = v.size();
    v.push_back(a);
  }

  void sort(void){
    vector<double> seta;
    Po ot;
    ot.real() = 1.0;
    ot.imag() = 0.0;
    swap(v[0],v[o]);
    o = 0;
    for(int i=1;i<(int)v.size();i++){
      seta.push_back(dot(ot,v[i]-v[0]) / (abs(ot)*abs(v[i]-v[0])) );
    } 
    for(int i=1;i<(int)v.size()-1;i++){
      for(int j=i+1;j<(int)v.size();j++){
	if(seta[i-1] < seta[j-1]){
	  swap(seta[i-1],seta[j-1]);
	  swap(v[i],v[j]);
	}
      }
    }
  }

  bool inter(Po a){
    int c = 0;
    double max = 0;
    Po b;
    line l,s;
    for(int i=0;i<(int)v.size();i++)if(max < v[i].real())max = v[i].real();
    b.real() = max+1;
    b.imag() = a.imag();
    s.set(a,b);
    for(int i=0;i<(int)v.size()-1;i++){
      l.set(v[i],v[i+1]);
      if(s.is_cross(l))c++;
    }
    l.set(v[(int)v.size()-1],v[0]);
    if(s.is_cross(l))c++;
    if(c%2)return true;
    else return false;
  }
};

int main(){
  int n;
  Po p1,p2,p3,pk,ps;
  polygon tri;

  cin >> n;

  for(int i=0;i<n;i++){
    cin >> p1.real() >> p1.imag();
    cin >> p2.real() >> p2.imag();
    cin >> p3.real() >> p3.imag();
    cin >> pk.real() >> pk.imag();
    cin >> ps.real() >> ps.imag();
    /*
    tri.set();
    tri.Vadd(p1);
    tri.Vadd(p2);
    tri.Vadd(p3);
    tri.sort();
    */
    //if(tri.inter(pk) != tri.inter(ps))cout << "OK" << endl;
    if(inter(p1,p2,p3,pk) != inter(p1,p2,p3,ps) )cout << "OK" << endl;
    else cout << "NG" << endl;
  }
  
}

Measured memory_bytes: 968