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

using namespace std;

vector< vector< int > > a, b, Sol1, Sol2;
vector< int > aux;
int n, t, u, x;

vector< vector< int > > solve(int n, int t){
    vector< vector< int > > A;
    A.clear();
    for(int i = 1; i <= t; ++i){
        aux.clear();
        for(int j = 1; j <= n; ++j){
            scanf("%d", &x);
            aux.push_back(x);
        }
        sort(aux.begin(), aux.end());
        A.push_back(aux);
    }
    return A;
}

vector< vector< int > > solve2(vector< vector< int > > A){
    vector< vector< int > > Sol;
    sort(A.begin(), A.end());
    Sol.clear();
    Sol.push_back(A[0]);
    for(int i = 1; i < A.size(); ++i)
        if(A[i] > A[i - 1])
            Sol.push_back(A[i]);
    return Sol;
}

int main(){
    freopen("amlei.in", "r", stdin);
    freopen("amlei.out", "w", stdout);
    while(scanf("%d %d %d", &n, &t, &u) == 3){
        a = solve(n, t);
        b = solve(n, u);
        Sol1 = solve2(a);
        Sol2 = solve2(b);
        if(Sol1 == Sol2)
            printf("DA\n");
        else
            printf("NU\n");
    }
    return 0;
}