#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
//#include <utility>
#include <set>
#include <iostream>
//#include <memory>
#include <string>
#include <vector>
#include <algorithm>
//#include <functional>
#include <sstream>
//#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
//#include <cctype>
#include <cstring>
//#include <ctime>
#include <iterator>
#include <bitset>
//#include <numeric>
//#include <list>
//#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 0
static const int INF=1<<24;
typedef complex<double> P;
typedef const P &rP;
typedef pair<P,P> seg;
vector<P> tri(3);
vector<P> aa(2);
double dot(rP a, rP b){
    return real(a) * real(b) + imag(a) * imag(b);
}
int check(P r){
	P a=tri[0]-tri[1],ar=r-tri[0];
	P b=tri[1]-tri[2],br=r-tri[1];
	P c=tri[2]-tri[0],cr=r-tri[2];
	double A=dot(ar,a),B=dot(br,b),C=dot(cr,c);
	if(A>EPS&&B>EPS&&C>EPS) return 1;
	if(A<-EPS&&B<-EPS&&C<-EPS) return 1;
	return -1;
}
void mainmain(){
	int n;
	cin>>n;
	rep(i,n){
		rep(j,3){
			double a,b;
			cin>>a>>b;
			tri[j]=P(a,b);
		}
		rep(j,2){
			double a,b;
			cin>>a>>b;
			aa[j]=P(a,b);	
		}
		if(check(aa[0])*(check(aa[1]))<0){
			cout<<"OK\n";
		}
		else{
			cout<<"NG\n";
		}
	}
}



}
main() try{
    mainmain();
}
catch(...){
}