#include <stdio.h>
#include <algorithm>

using namespace std;

#define MAX_E 512
#define MAX_N 64
#define FIN "amlei.in"
#define FOUT "amlei.out"
#define abs(x) ((x) < 0 ? -(x) : (x))

int T, N, A, B, E1[MAX_E], E2[MAX_E];

bool cmp(int i, int j)
{
    return abs(i) < abs(j);
}

int main(void)
{
    int i, j, V[MAX_N];
    long long t;

    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);

    while (scanf("%d %d %d", &N, &A, &B) == 3)
    {
        for (i = 0; i < A; i++)
        {
            for (j = 0; j < N; j++)
                scanf("%d", V+j);
            sort(V, V+N, cmp);
            t = 0;
            for (j = 0; j < N; j++)
                t = (t<<1)|(V[j]>0);
            E1[i] = t;
        }
        for (i = 0; i < B; i++)
        {
            for (j = 0; j < N; j++)
                scanf("%d", V+j);
            sort(V, V+N, cmp);
            t = 0;
            for (j = 0; j < N; j++)
                t = (t<<1)|(V[j]>0);
            E2[i] = t;
        }

        sort(E1, E1+A);
        A = unique(E1, E1+A)-E1;
        sort(E2, E2+B);
        B = unique(E2, E2+B)-E2;

        if (A != B) { printf("NU\n"); continue; }
        for (i = 0; i < A; i++)
            if (E1[i] != E2[i]) break;
        printf("%s\n", i == A ? "DA" : "NU");
    }

    return 0;
}