#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5+114;
map<int,int> use[maxn];
int n,m;
vector<int> G[maxn],T[maxn<<1];
int stk[maxn],tp,low[maxn],dfn[maxn],dfc;
int cnt;
void Tarjan(int u){
    low[u]=dfn[u]=++dfc;
    stk[++tp]=u;
    for(int v:G[u]){
        if(dfn[v]==0){
            Tarjan(v);
            low[u]=min(low[u],low[v]);
            if(low[v]>=dfn[u]){
                ++cnt;
                for(int x=0;x!=v;tp--){
                    x=stk[tp];
                    T[cnt].push_back(x);
                    T[x].push_back(cnt);
                }
                T[cnt].push_back(u);
                T[u].push_back(cnt);
            }
        }else low[u]=min(low[u],dfn[v]);
    }
}
bool flag;
int vis[maxn<<1];
int sz[maxn<<1];
int sum;
int H;
void dfs(int u,int fa){
    sz[u]=(u<=n);
    int Min=0x3f3f3f3f,Max=0;
    for(int v:T[u]){
        if(v!=fa&&vis[v]==0) dfs(v,u),sz[u]+=sz[v],Min=min(Min,sz[v]),Max=max(Max,sz[v]);
    }
    Min=min(Min,sum-sz[u]);
    Max=max(Max,sum-sz[u]);
    if(u>n){
        if(Min==sum/3&&Max==Min) H=u;
    }
}
void solve(int u,int sm){
    if(sm==1) return ;
    sum=sm;
    H=0;
    dfs(u,0);
    if(H==0){
        flag=true;
        return ;
    }
    vis[H]=1;
    if(sm%3!=0){
        flag=true;
        return ;
    }
    for(int v:T[H]){
        if(vis[v]==0){
            solve(v,sm/3);
            if(flag==true) return;
        }
    }
}
int main(){
    cin>>n>>m;
    cnt=n;
    for(int i=1;i<=m;i++){
        int u,v;
        cin>>u>>v;
        if(u==v){
            cout<<"ne\n";
            return 0;
        }
        if(use[u][v]==1){
            cout<<"ne\n";
            return 0;
        }
        use[u][v]=use[v][u]=1;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    Tarjan(1);
    for(int i=1;i<=n;i++){
        if(dfn[i]==0){
            cout<<"ne\n";
            return 0;
        }
    }
    solve(1,n);
    cout<<(flag==false?"da\n":"ne\n");
    return 0;
}