#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <cstring>
#include <stack>
#include <assert.h>
using namespace std;

#define IT(c) typeof((c).begin())

#define For(i, a, b) for(int (i) =  int(a); i < int(b); ++i)
#define rep(x, n) For(x,0,n)
#define foreach(i, c) for(IT(c) i = (c).begin(); i != (c).end(); ++i)

#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define F first
#define S second

typedef vector<int> Vi;
typedef vector<vector<int> > Vvi;
typedef vector<string> Vs;
typedef pair<int, int> Pi;

vector<int> nw, nh;

const int inf = 1000000000;

int aw=inf, bw=0, ah=inf, bh=0;

int main(){
int np; cin>>np;
rep(tp,np){
	nw.clear(); nh.clear();
	int n; cin>>n;
	aw=inf, bw=0, ah=inf, bh=0;
	rep(i,n){
		int w,h; string s; cin>>w>>h>>s;
		
		if(s == "BIRD"){
			aw = min(aw, w); bw = max(bw,w);
			ah = min(ah, h); bh = max(bh, h);
		} else{
			cin>>s;
			assert(s=="BIRD");
			nw.pb(w); nh.pb(h);
		}
	}
	printf("Case #%d:\n",tp+1); 
	int m; cin>>m; 
	rep(j,m){
		int w, h; cin>>w>>h;
		if(w>=aw && w <= bw && h>=ah && h <= bh)
			cout<<"BIRD"<<endl;
		else{
			int awp, bwp, ahp, bhp;
			awp = min(aw, w);
			bwp = max(bw, w);
			ahp = min(ah, h);
			bhp = max(bh, h);
			bool bad = false;
			rep(i, sz(nh)){
				if((nh[i] >= ahp && nh[i] <= bhp && nw[i] >= awp &&
							nw[i] <= bwp))
				bad = true;
			}
			cout<<(bad ? "NOT BIRD" : "UNKNOWN")<<endl;
		}
	}

}

}