#include <cstdio>
#include <queue>

using namespace std;

int w,h;
bool** flags;
char** map;

class Point{
public:
	int X,Y;
};

template <class T> T** NewArray(int w,int h){
	T** r = new T*[w];
	for(int i=0;i<w;i++){
		r[i] = new T[h];
		for(int j=0;j<h;j++){
			r[i][j] = 0;
		}
	}
	return r;
}

template <class T> void RemoveArray(T** array,int w,int h){
	for(int i=0;i<h;i++){
		delete[] array[i];
	}
	delete[] array;
}

bool Check(int x,int y,int c){
	if(x<0){return false;}
	if(y<0){return false;}
	if(x>=w){return false;}
	if(y>=h){return false;}
	if(flags[x][y]){return false;}
	if(map[x][y] != c){return false;}
}

bool Solve(int sx,int sy,int gx,int gy){
	char c = map[sx][sy];
	queue<Point> pts;
	flags = NewArray<bool>(w + 1,h + 1);
	for(int i=0;i<w;i++){
		for(int j=0;j<h;j++){
			flags[i][j] = false;
		}
	}
	Point p,pp;
	p.X = sx;
	p.Y = sy;
	pts.push(p);
	flags[sx][sy] = true;
	
	bool res = false;
	
	while(pts.size() > 0){
		p = pts.front();
		pts.pop();
		if(flags[gx][gy] == true){
			res = true;
			break;
		}
		pp = p;
		pp.X -= 1;
		if(Check(pp.X,pp.Y,c)){ pts.push(pp); flags[pp.X][pp.Y]=true; }
		pp = p;
		pp.X += 1;
		if(Check(pp.X,pp.Y,c)){ pts.push(pp); flags[pp.X][pp.Y]=true; }
		pp = p;
		pp.Y -= 1;
		if(Check(pp.X,pp.Y,c)){ pts.push(pp); flags[pp.X][pp.Y]=true; }
		pp = p;
		pp.Y += 1;
		if(Check(pp.X,pp.Y,c)){ pts.push(pp); flags[pp.X][pp.Y]=true; }
	}
	
	RemoveArray<bool>(flags,w + 1,h + 1);
	return res;
}

int main(){
	int xs,ys,xg,yg;
	
	while(scanf("%d %d",&w,&h) && w && h){
		map = NewArray<char>(w + 1,h + 1);
		scanf("%d %d %d %d",&xs,&ys,&xg,&yg);
		xs -= 1;
		ys -= 1;
		xg -= 1;
		yg -= 1;
		int n;
		scanf("%d",&n);
		int c,d,x,y;
		int xx,yy;
		for(int j=0;j<h;j++){
			for(int i=0;i<w;i++){
				//printf("%d ",map[i][j]);
				map[i][j] = 0;
			}
			//printf("\n");
		}
		
		for(int i=0;i<n;i++){
			scanf("%d %d %d %d",&c,&d,&x,&y);
			if(d == 0){
				xx = 4;
				yy = 2;
			}else{
				xx = 2;
				yy = 4;
			}
			x-=1;
			y-=1;
			for(int j=0;j<xx;j++){
				for(int k=0;k<yy;k++){
					//printf("(%2d+%2d,%2d+%2d) = %d\n",k,j,y,k,c);
					map[x+j][y+k] = c;
				}
			}
		}
		
		
		if(Solve(xs,ys,xg,yg)){
			printf("OK\n");
		}else{
			printf("NG\n");
		}
		RemoveArray<char>(map,w + 1,h + 1);
	}
}