#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n)  { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x)         { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};

int main() {
	int n, u, v, m;
	cin >> n >> u >> v >> m;
	map<int, pair<int, int>> bingo_u;
	map<int, pair<int, int>> bingo_v;
	REP(i,n)
		REP(j, n){
		int num;
		cin >> num;
		bingo_u[num] = pair<int, int>(i,j);
	}
	REP(i, n)
		REP(j, n){
		int num;
		cin >> num;
		bingo_v[num] = pair<int, int>(i, j);
	}
	queue<int> tyusen;
	REP(i, m){
		int num;
		cin >> num;
		tyusen.push(num);
	}
	vector<int> usa_h(n,0);
	vector<int> usa_v(n,0);
	int usa_naname[2] = {0};
	vector<int> nek_h(n,0);
	vector<int> nek_v(n,0);
	int nek_naname[2] = {0};

	while (!tyusen.empty()){
		int q = tyusen.front(); tyusen.pop();
		if (bingo_u.find(q) != bingo_u.end()){
			if (n == 1)
				u--;
			else{
				usa_h[bingo_u[q].first]++;
				if (usa_h[bingo_u[q].first] == n)
					u--;
				usa_v[bingo_u[q].second]++;
				if (usa_v[bingo_u[q].second] == n)
					u--;
				if (bingo_u[q].first == bingo_u[q].second){
					usa_naname[0]++;
					if (usa_naname[0] == n)
						u--;
				}
				if (bingo_u[q].first + bingo_u[q].second == n - 1){
					usa_naname[1]++;
					if (usa_naname[1] == n)
						u--;
				}
			}
		}
		if (bingo_v.find(q) != bingo_v.end()){
			if (n == 1)
				v--;
			else{
				nek_h[bingo_v[q].first]++;
				if (nek_h[bingo_v[q].first] == n)
					v--;
				nek_v[bingo_v[q].second]++;
				if (nek_v[bingo_v[q].second] == n)
					v--;
				if (bingo_v[q].first == bingo_v[q].second){
					nek_naname[0]++;
					if (nek_naname[0] == n)
						v--;
				}
				if (bingo_v[q].first + bingo_v[q].second == n - 1){
					nek_naname[1]++;
					if (nek_naname[1] == n)
						v--;
				}
			}
		}
		if (u <= 0 && v <= 0){
			cout << "DRAW" << endl;
			return 0;
		}
		else if (u <= 0){
			cout << "USAGI" << endl;
			return 0;
		}
		else if (v<=0){
			cout << "NEKO" << endl;
			return 0;
		}
	}
	cout << "DRAW" << endl;
}