#include <vector>
#include <set>
#include <algorithm>
#include "fstream"

using namespace std;

ifstream cin("in.in");
ofstream cout("out.out");

int n, t, u ;
vector < int > v ;
set < vector < int > > s1, s2 ;

int main()
{

    while (cin >> n >> t >> u)
    {

        int x ;

        for (int i = 0; i < t; ++i) {
            for (int j = 0; j < n; ++j) {
                cin >> x;
                v.emplace_back(x);
            }

            sort (v.begin(), v.end()) ;
            s1.insert(v) ;
            v.clear() ;

        }

        for (int i = 0; i < u; ++i) {
            for (int j = 0; j < n; ++j) {
                cin >> x ;
                v.emplace_back(x) ;
            }

            sort (v.begin(), v.end()) ;
            s2.insert(v) ;
            v.clear() ;

        }

        if (s1 == s2)
            cout << "DA" << '\n' ;

        else
            cout << "NU" << '\n' ;

        s1.clear() ;
        s2.clear() ;

    }


    return 0 ;

}