#include <cstdio>
#include <cstdint>
#include <vector>
#include <algorithm>
#include <map>

size_t achieve(const std::vector<std::vector<int>>& bingo,
               const std::map<int, size_t>& nth, size_t u) {

  size_t n = bingo.size();
  std::vector<std::vector<size_t>> a(n, std::vector<size_t>(n, -1));
  for (size_t i = 0; i < n; ++i)
    for (size_t j = 0; j < n; ++j) {
      auto it = nth.find(bingo[i][j]);
      if (it == nth.end()) continue;
      a[i][j] = it->second;
    }

  // for (size_t i = 0; i < n; ++i)
  //   for (size_t j = 0; j < n; ++j)
  //     fprintf(stderr, "%jd%c", a[i][j], j+1<n? ' ':'\n');

  std::vector<size_t> res;
  res.reserve(2*n+2);
  for (size_t i = 0; i < n; ++i) {
    res.push_back(*std::max_element(a[i].begin(), a[i].end()));

    size_t cur = 0;
    for (size_t j = 0; j < n; ++j)
      cur = std::max(cur, a[j][i]);

    res.push_back(cur);
  }

  size_t d0 = 0;
  size_t d1 = 0;
  for (size_t i = 0; i < n; ++i) {
    d0 = std::max(d0, a[i][i]);
    d1 = std::max(d1, a[i][n-i-1]);
  }
  res.push_back(d0);
  res.push_back(d1);

  if (n == 1) res.resize(1);  // ???

  --u;
  if (res.size() <= u) return -1;

  // for (size_t i = 0; i < res.size(); ++i)
  //   fprintf(stderr, "%zd%c", res[i], i+1<res.size()? ' ':'\n');
  std::sort(res.begin(), res.end());
  // for (size_t i = 0; i < res.size(); ++i)
  //   fprintf(stderr, "%zd%c", res[i], i+1<res.size()? ' ':'\n');

  return res[u];
}

int main() {
  size_t n, m;
  size_t u, v;
  scanf("%zu %zu %zu %zu", &n, &u, &v, &m);

  std::vector<std::vector<int>> usagi(n, std::vector<int>(n));
  auto neko = usagi;

  for (size_t i = 0; i < n; ++i)
    for (size_t j = 0; j < n; ++j)
      scanf("%d", &usagi[i][j]);

  for (size_t i = 0; i < n; ++i)
    for (size_t j = 0; j < n; ++j)
      scanf("%d", &neko[i][j]);

  std::map<int, size_t> nth;
  for (size_t i = 0; i < m; ++i) {
    int d;
    scanf("%d", &d);
    nth[d] = i;
  }

  size_t pyon = achieve(usagi, nth, u);
  size_t nyan = achieve(neko, nth, v);

  if (pyon < nyan) {
    puts("USAGI");
  } else if (pyon > nyan) {
    puts("NEKO");
  } else {
    puts("DRAW");
  }
}

