#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (int i = (int)x; i < (int)limit; i++)
#define REP(i, x, limit) for (int i = (int)x; i <= (int)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n,m;cin>>n>>m;
  vvl G1(n),G2(n);
  while(m--){
    ll u,v;cin>>u>>v;
    u--;v--;
    G1[u].push_back(v);
    G2[v].push_back(u);
  }
  vi P(n,-1);
  queue<ll> que;
  rep(i,0,n){
    if(G1[i].size()==0){
      P[i]=1;
      que.push(i);
    }
  }
  while(!que.empty()){
    auto a=que.front();que.pop();
    for(auto to:G2[a]){
      if(P[to]==-1){
        if(P[a]==1){
          P[to]=0;
          que.push(to);
        }else{
          bool f=true;
          for(auto tto:G1[to]){
            if(P[tto]!=0){
              f=false;
              break;
            }
          }
          if(f){
            P[to]=1;
            que.push(to);
          }
        }
      }
    }
  }
  if(P[0]==-1)cout<<"Draw"<<el;
  else if(P[0]==0)cout<<"Alice"<<el;
  else cout<<"Bob"<<el;
}