#include <cstdio>
#include <vector>
#include <set>
#include <algorithm>

std::set <std::vector <int> > sa, sb;
std::vector <int> v;

int main() {
  int n, t, u, x;
  FILE *fin = fopen("amlei.in", "r");
  FILE *fout = fopen("amlei.out", "w");
  while (fscanf(fin, "%d%d%d", &n, &t, &u) == 3) {
    sa.clear();
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < t; ++j) {
        fscanf(fin, "%d", &x);
        if (x > 0) {
          v.push_back(x);
        }
      }    
      std::sort(v.begin(), v.end());
      sa.insert(v);
      v.clear();
    }
    sb.clear();
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < u; ++j) {
        fscanf(fin, "%d", &x);
        if (x > 0) {
          v.push_back(x);
        }
      }
      std::sort(v.begin(), v.end());
      sb.insert(v);
      v.clear();
    }
    fprintf(fout, "%s\n", sa == sb ? "DA" : "NU");
  }
  fclose(fin);
  fclose(fout);
  return 0;
}