#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
const double EPS = 1e-5;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef long long ll;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }
 
typedef complex<double> P;
 
double triangleArea(P a, P b, P c)
{
    b -= a;
    c -= a;
    
    return (0.5 * abs(b.imag() * c.real() - c.imag() * b.real()));
}
 
// _ªOp`ÌÉ é©
bool isInTriangle(P p[3], P x)
{
    int i;
    double S = triangleArea(p[0], p[1], p[2]);
    
    rep(i, 3) S -= triangleArea(x, p[i], p[(i + 1) % 3]);
    
    return abs(S) < EPS;
}
 
int main()
{
    int n;
        cin >> n;
        
        
        while(n--)
        {
                P p[3];
                P k, s;
                
                rep(i, 3) cin >> p[i].real() >> p[i].imag();
                cin >> k.real() >> k.imag() >> s.real() >> s.imag();
        
                if(isInTriangle(p, k) ^ isInTriangle(p, s))
                {
                        cout << "OK" << endl;
                }
                else
                {
                        cout << "NG" << endl;
                }
        }
}
 