#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5 + 500;
const int MAXM = 3e5 + 500;

int n, m;
vector<pair<int, int> > susjedi[MAXN], bridovi;
int maknut[MAXM];
int provc[20], provv[20], kolko, bio[MAXN], d[MAXN], w[MAXN];
vector<int> v;
int cnt;

void dfs (int x) {
    v.push_back (x);
    bio[x] = cnt;
    w[x] = 1;
    for (auto it: susjedi[x]) {
        if (maknut[it.second]) continue;
        int nx = it.first;
        if (bio[nx] != cnt) {
            d[nx] = d[x] + 1;
            dfs (nx);
            w[x] += w[nx];
        }
        bridovi.push_back ({x, nx});
    }
}

int pogle (int x, int y) {
    for (auto it: susjedi[x]) bio[it.first] = 0;
    for (auto it: susjedi[y]) bio[it.first] = 0;

    for (auto it: susjedi[x]) {
        if (maknut[it.second]) continue;
        bio[it.first]++;
    }
    for (auto it: susjedi[y]) {
        if (maknut[it.second]) continue;
        bio[it.first]++;
    }

    int vrati = -1;
    for (auto it: susjedi[x]) {
        if (!maknut[it.second] && bio[it.first] == 2) {
            if (vrati == -1) vrati = it.first;
            else return -1;
        }
    }
    return vrati;
}

bool solve (int x, int k) {
    v.clear ();
    bridovi.clear ();
    cnt++;
    d[x] = 0;
    dfs (x);
    if (v.size () != provc[k]) return false;
    if ((bridovi.size () / 2) != provv[k]) return false;
    if (k == 0) return true;

    int a = -1, b = -1, c = -1;
    for (auto it: bridovi) {
        int x = it.first, y = it.second;
        int z = pogle (x, y);
        if (z == -1) continue;

        if (d[x] > d[y]) swap (x, y);
        if (d[y] > d[z]) swap (y, z);
        if (d[x] > d[y]) swap (x, y);

        if (w[z] == provc[k] / 3 && v.size () - w[y] == provc[k] / 3) {
            if (a != -1 && ((a != x || b != y || c != z))) return false;
            a = x;
            b = y;
            c = z;
        }
    }
    if (a == -1) return false;

    for (auto it: susjedi[a]) {
        if (it.first == b) maknut[it.second] = 1;
        if (it.first == c) maknut[it.second] = 1;
    }
    for (auto it: susjedi[b]) {
        if (it.first == c) maknut[it.second] = 1;
    }

    if (solve (a, k - 1) && solve (b, k - 1) && solve (c, k - 1)) return true;
    return false;
}

int main () {
    ios_base::sync_with_stdio (false);
    cin.tie (0);

    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--;b--;
        susjedi[a].push_back ({b, i});
        susjedi[b].push_back ({a, i});
    }
    provc[0] = 1;
    provv[0] = 0;

    for (int i = 0; i < 12; i++) {
        if (provc[i] == n && provv[i] == m) {
            kolko = i;
            break;
        }
        if (i == 11) {
            cout << "ne";
            return 0;
        }
        provc[i + 1] = provc[i] * 3;
        provv[i + 1] = provv[i] * 3 + 3;
    }


    for (int i = 0; i < n; i++) {
        if (susjedi[i].size () % 2 == 1) {
            cout << "ne";
            return 0;
        }
    }

    if (solve (0, kolko)) cout << "da";
    else cout << "ne";

    return 0;
}