#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream fin( "amlei.in" );
ofstream fout( "amlei.out" );

const int NMAX = 52;

int N, t, u;

struct conj
{
   vector <int> V;
};

vector <conj> A;
vector <conj> B;

int main()
{
    while( fin >> N >> t >> u )
    {
        vector <long long> A;
        vector <long long> B;

        for( int i = 1; i <= t; ++i )
        {
           int nr;
           long long aux = 0;

           for( int j = 1; j <= N; ++j )
           {
               fin >> nr;
               if( nr > 0 ) aux = aux ^ ( 1LL << nr );
           }

           A.push_back( aux );
        }

        for( int i = 1; i <= u; ++i )
        {
           int nr;
           long long aux = 0;

           for( int j = 1; j <= N; ++j )
           {
               fin >> nr;
               if( nr > 0 ) aux = aux ^ ( 1LL << nr );
           }

           B.push_back( aux );
        }

        sort( A.begin(), A.end() );
        sort( B.begin(), B.end() );

        bool ok = true;

        for( int i = 0; i < t && ok; ++i )
        {
           ok = false;

           for( int j = 0; j < u; ++j )
             if( A[i] == B[j] ) { ok = true; break; }
        }

        if( ok ) fout << "DA\n";
        else fout << "NU\n";
    }

}

/*int main()
{
    while( fin >> N >> t >> u )
    {
        for( int i = 1; i <= t; ++i )
        {
           conj aux;
           int nr;

           for( int j = 1; j <= N; ++j )
           {
               fin >> nr;

               aux.push_back( nr );
           }

           A.push_back( aux );
        }
        for( int i = 1; i <= u; ++i )
        {
           conj aux;
           int nr;

           for( int j = 1; j <= N; ++j )
           {
               fin >> nr;

               aux.push_back( nr );
           }

           B.push_back( aux );
        }

        for( int i = 1; i <= t; ++i )
          sort( )
    }


    return 0;
}*/