using namespace std;

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

int n[2], x;
vector <vector <int> > a[2];
vector <int> v;

int main()
{
	int i, j, k, t;

	freopen("amlei.in", "r", stdin);
	freopen("amlei.out", "w", stdout);
	
	while (scanf("%d %d %d\n", &x, n, n+1) == 3) {
		a[0].clear(), a[1].clear();
		for (k = 0; k < 2; ++k) {
			for (i = 0; i < n[k]; ++i) {
				v.clear();
				for (j = 0; j < x; ++j) {
					scanf("%d", &t);
					v.push_back(t);
				}
				sort(v.begin(), v.end());
				a[k].push_back(v);
			}
			sort(a[k].begin(), a[k].end());
			a[k].erase(unique(a[k].begin(), a[k].end()), a[k].end());
		}
		printf("%s\n", a[0] == a[1] ? "DA" : "NU");
	}
	return 0;
}