#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>

using namespace std;

double EPS = 1e-10;

double add(double a, double b) {
	if (abs(a + b) < EPS * (abs(a) + abs(b))) {
		return 0;
	}
	return a + b;
}

struct P {
	double x, y;
	P() {}
	P(double x, double y) : x(x), y(y) {
	}
	P operator + (P p) {
		return P(add(x, p.x), add(y, p.y));
	}
	P operator - (P p) {
		return P(add(x, -p.x), add(y, -p.y));
	}
	P operator * (double d) {
		return P(x * d, y * d);
	}
	double dot(P p) {
		return add(x * p.x, y * p.y);
	}
	double det(P p) {
		return add(x * p.y, -y * p.x);
	}
};

bool cmp_x(const P& p, const P& q) {
	if (p.x != q.x) {
		return p.x < q.x;
	}
	return p.y < q.y;
}

vector<P> convex_hull(P* ps, int n) {
	sort(ps, ps + n, cmp_x);
	int k = 0;
	vector<P> qs(n * 2);

	for (int i = 0; i < n; i++) {
		while (k > 1 && (qs[k-1] - qs[k-2]).det(ps[i] - qs[k-1]) <= 0) {
			k--;
		}
		qs[k++] = ps[i];
	}
	for (int i = n-2, t = k; i >= 0; i--) {
		while (k > t && (qs[k-1] - qs[k-2]).det(ps[i] - qs[k-1]) <= 0) {
			k--;
		}
		qs[k++] = ps[i];
	}
	qs.resize(k-1);
	return qs;
}

P ps[10];

int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		P pp, qq;
		P psp[3];
		cin >> psp[0].x >> psp[0].y >> psp[1].x >> psp[1].y >> psp[2].x >> psp[2].y >> pp.x >> pp.y >> qq.x >> qq.y;
		for (int j = 0; j < 3; j++) {
			ps[j] = psp[j];
		}
		ps[3] = pp;
		vector<P> qs = convex_hull(ps, 4);
		bool hantei;
		if (qs.size() == 4) {
			hantei = false;
		} else {
			hantei = true;
			for (int j = 0; j < 3; j++) {
				if (qs[j].x == pp.x && qs[j].y == pp.y) {
					hantei = false;
					break;
				}
			}
		}
		for (int j = 0; j < 3; j++) {
			ps[j] = psp[j];
		}
		ps[3] = qq;
		qs = convex_hull(ps, 4);
		bool hantei2;
		if (qs.size() == 4) {
			hantei2 = false;
		} else {
			hantei2 = true;
			for (int j = 0; j < 3; j++) {
				if (qs[j].x == qq.x && qs[j].y == qq.y) {
					hantei2 = false;
					break;
				}
			}
		}
		if (hantei == hantei2) {
			cout << "NG" << endl;
		} else {
			cout << "OK" << endl;
		}
	}
	return 0;
}