#include <iostream>
using namespace std;

int map[102][102];

void route(int w, int h, int color) {
	if (map[w][h] != color)
		return;
	map[w][h] = 0;
	route(w, h + 1, color);
	route(w + 1, h, color);
	route(w, h - 1, color);
	route(w - 1, h, color);
}


int main() {
	int h, w, xs, ys, xg, yg, n;
	int c, d, x, y,color;

	while (1) {
		cin >> w >> h >> xs >> ys >> xg >> yg >> n;
		if (w == 0 && h == 0)
			break;

		for (int i = 0; i<n; i++) {
			cin >> c >> d >> x >> y;
			if (d == 0) {
				for (int j = 0; j < 4; j++)
					map[j + x][y] = map[j + x][y + 1] = c;
			}
			else {
				for (int j = 0; j < 4; j++)
					map[x][y + j] = map[x + 1][y + j] = c;
			}
		}
		color = map[xs][ys];
		if(color!=0)
			route(xs, ys, color);
		if (map[xg][yg]==0)
			cout << "OK" << endl;
		else
			cout << "NG"<<endl;
	}

	return 0;
}