#include<cstdio>
#include<algorithm>
using namespace std;
int a,n,t,u,i,j,l,c[51],r,x,y,k,o,z[501],s,h;
int main()
{FILE *f=fopen("amlei.in","r"),*g=fopen("amlei.out","w");
while(!feof(f))
     {fscanf(f,"%d%d%d",&n,&t,&u);
     for(s=l=0,h=o=i=1;o<=t;i++)
           {fscanf(f,"%d",&c[i]),s+=c[i];
           if(i%n==0)
                   {sort(c+1,c+n+1);
                   for(y=k=1;k<=l&&y;k++)
                   if(s==z[k])
                         y=0;
                   if(y)
                         z[++l]=s;
                   o++,s=i=0;}}
     for(o=i=1;o<=u;i++)
           {fscanf(f,"%d",&c[i]),s+=c[i];
           if(i%n==0)
                   {sort(c+1,c+n+1);
                   for(y=k=1;k<=l&&y;k++)
                   if(s==z[k])
                         y=0;
                   if(y)
                         h=0;
                   o++,s=i=0;}}
     if(feof(f))
           break;
     fprintf(g,"%s\n",h?"DA":"NU");}
return 0;}