#include <bits/stdc++.h>

using namespace std;

ifstream in("amlei.in");
ofstream out("amlei.out");

set<int> s;
vector<int> v;
map<vector<int>, int> mt, mu;
int n, t, u;

void amlei(int val, map<vector<int>, int> &m) {
    for (int i = 1; i <= val; ++i) {
        s.clear();
        for (int j = 1; j <= n; ++j) {
            int x;
            in >> x;

            s.insert(x);
        }

        v.clear();

        for (auto it: s) v.emplace_back(it);

        m[v] = 1;
    }
}

int main() {
    while (in >> n >> t >> u) {
        mt.clear(), mu.clear();
        amlei(t, mt),amlei(u, mu);

        bool ok = 1;

        for (auto I: mu) mt[I.first]--;
        for (auto I: mt) if (I.second != 0) ok = 0;

        if (ok) out << "DA" << '\n';
        else out << "NU" << '\n';
    }
    return 0;
}