using namespace std;
#include<cstdio>
#include<algorithm>
#define Am 500
int n;
long long A[Am],B[Am];

void read(long long A[], int a)
{
    int i,j,k;

    for(i=0;i<a;++i)
    {
        A[i]=0;
        for(j=0;j<n;++j)
        {
            scanf("%d",&k);
            if(k>0)
                A[i]|=1<<k;
        }
    }
}

int main()
{
    int a,b,i;

    freopen("amlei.in","r",stdin);
    freopen("amlei.out","w",stdout);
    
    while(scanf("%d%d%d",&n,&a,&b)==3)
    {
        read(A,a);
        read(B,b);
        sort(A,A+a);
        sort(B,B+b);
        
        for(i=0;i<a;++i)
            if(!binary_search(B,B+b,A[i]))
                break;
        if(i<a)
            printf("NU\n");
        else
            printf("DA\n");
    }

    return 0;
}