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

using namespace std;

#define MAXN 505

int N, A, B;
vector< long long > a, b;

int main()
{
	freopen("amlei.in", "rt", stdin);
	freopen("amlei.out", "wt", stdout);

	for ( ; scanf("%d %d %d", &N, &A, &B) != EOF; )
	{
		int i, j, l; long long k;
		a.clear(); b.clear();
		for (i = 0; i < A; i++)
		{
			k = 0;
			for (j = 0; j < N; j++)
			{
				scanf("%d", &l);
				if (l < 0)
					k |= (1 << (-l - 1));
			}
			a.push_back( k );
		}
		sort(a.begin(), a.end());
		a.resize( unique( a.begin(), a.end() ) - a.begin() );
		for (i = 0; i < B; i++)
		{
			k = 0;
			for (j = 0; j < N; j++)
			{
				scanf("%d", &l);
				if (l < 0)
					k |= (1 << (-l - 1));
			}
			b.push_back( k );
		}
		sort(b.begin(), b.end());
		b.resize( unique( b.begin(), b.end() ) - b.begin() );

		printf("%s\n", (a == b) ? "DA" : "NU");		
	}
	return 0;
}