#include<vector>
#include<cstdio>
#include<algorithm>
#include<set>
using namespace std;
struct P
{
	set< vector<int> > S;
	int n,t;
	void read(int N,int T)
	{
		n=N;t=T;
		vector<int> v; S.clear();
		for(int i=0;i<t;i++)
		{
			v.clear();
			for(int x,j=0;j<n;j++)
			{
				scanf("%d",&x);
				if(x>0) v.push_back(x);
			}
			sort(v.begin(),v.end());
			S.insert(v);
		}
	}
} a,b;
int main()
{
	freopen("amlei.in","r",stdin);
	freopen("amlei.out","w",stdout);
	int T,n,x,y;
	//scanf("%d",&T);
	while(1)
	{
		
		if(scanf("%d%d%d",&n,&x,&y)!=3)
			return 0;
		a.read(n,x);
		b.read(n,y);
		puts(a.S==b.S?"DA":"NU");
	}
	return 0;
}