#include<iostream>
#include<map>
using namespace std;

bool dfs(int x,int y);
int w,h;
int xs,ys;
int xg,yg;
int board[111][111];
int cheak[111][111];
int xd[]={0,-1,0,1};
int yd[]={-1,0,1,0};
int main(){
  int n;
  int c,d,x,y;
  int a[]={1,0,1,0,1,0,1};
  int b[]={0,1,1,2,2,3,3};
  while(1){
    cin >> w >> h;
    if(w==0 && h==0) break;
    for(int i=0;i<h;i++){
      for(int j=0;j<w;j++){
	board[i][j]=0;
	cheak[i][j]=0;
	cout << board[i][j];
      }
      cout << endl;
    }
    cin >> xs >> ys;
    cin >> xg >> yg;
    cin >> n;
    for(int i=0;i<n;i++){
      cin >> c >> d >> x >> y;
      board[y-1][x-1]=c;
      for(int j=0;j<7;j++){
	if(d==0) board[y+a[j]-1][x+b[j]-1]=c;
	else board[y+b[j]-1][x+a[j]-1]=c;
      }
    }
    if(board[ys][xs]!=0){
      if(dfs(xs-1,ys-1)==true) cout << "OK" << endl;
      else cout << "NG" << endl;
    }
    else cout << "NG" << endl;
  }
}

bool dfs(int x,int y){
  cheak[y][x]=1;
  if(x==xg-1 && y==yg-1) return true;
  for(int i=0;i<4;i++){
    int xn=x+xd[i];
    int yn=y+yd[i];
    if(xn>=0 && xn<w && yn>=0 && yn<h && board[yn][xn]==board[ys-1][xs-1] && cheak[yn][xn]==0){
      if(dfs(xn,yn)==true) return true;
    }
  }
  return false;
}