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

using namespace std;

#define FOR(i,s,d) for(i=(s);i<(d);i++)
#define pb push_back

int n,L[2];
vector <vector <int> > A[2];

int main()
{
	freopen("amlei.in","r",stdin);
	freopen("amlei.out","w",stdout);
	int i,j,z,ii;
	vector <int> x;
	while(scanf("%d",&n)==1)
	{
		scanf("%d %d",&L[0],&L[1]);
		FOR(z,0,2)
		{
			A[z].clear();
			FOR(i,0,L[z])	
			{
				x.clear();
				FOR(j,0,n)
				{
					scanf("%d",&ii);
					x.pb(ii);
				}
				sort(x.begin(),x.end());
				A[z].pb(x);
			}
			sort(A[z].begin(),A[z].end());
			A[z].erase(unique(A[z].begin(),A[z].end()),A[z].end());
		}		
		if(A[0]==A[1])
			printf("DA\n");
		else
			printf("NU\n");
		FOR(z,0,2) FOR(i,0,n)
			A[z][i].clear();
	}
	return 0;
}