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

using namespace std;

#define pb push_back
#define sz size()

int n, t, u;
vector< vector<int> > v1, v2;
vector<int> tmp;

void solve()
{
    int i, j, a;
    scanf("%d %d %d\n", &n, &t, &u);
    
    v1.clear();
    for (i = 1; i <= t; ++i)
    {
        tmp.clear();
        for (j = 1; j <= n; ++j)
        {
            scanf("%d", &a);
            tmp.pb(a);
        }
        sort(tmp.begin(), tmp.end());
        v1.pb(tmp);
    }
    
    v2.clear();
    for (i = 1; i <= u; ++i)
    {
        tmp.clear();
        for (j = 1; j <= n; ++j)
        {
            scanf("%d", &a);
            tmp.pb(a);
        }
        sort(tmp.begin(), tmp.end());
        v2.pb(tmp);
    }
    
    scanf("\n");
    
    sort(v1.begin(), v1.end());
    sort(v2.begin(), v2.end());
    
    typeof(v2.begin()) end;
    
    end = unique(v2.begin(), v2.end());
    v2.erase(end, v2.end());
    
    end = unique(v1.begin(), v1.end());
    v1.erase(end, v1.end());
    
    if (v1 == v2)
        printf("DA\n");
    else
        printf("NU\n");
}

int main()
{
    freopen("amlei.in", "r", stdin);
    freopen("amlei.out", "w", stdout);
    while (!feof(stdin))
        solve();
    return 0;
}