#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000010, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
int n, m, w[N];

int e[N], ne[N], h[N], idx, din[N];
void add(int a, int b) { e[idx] = b, ne[idx] = h[a], h[a] = idx++; }
int f[N];

int main() {
    memset(h, -1, sizeof h);
    cin >> n >> m;
    for (int i = 1, a, b; i < m + 1; i++) {
        scanf("%d%d", &a, &b);
        add(b, a);
        din[a]++;
    }
    queue<int> q;
    for (int i = 1; i < n + 1; i++)
        if (!din[i])
            f[i] = 2, q.push(i);
    while (q.size()) {
        auto u = q.front(); q.pop();
        for (int i = h[u]; ~i; i = ne[i]) {
            int j = e[i];
            --din[j];
            if (!f[j]) {
                if (f[u] == 2) f[j] = 1;
                else if (f[u] == 1 && !din[j]) f[j] = 2;
                else continue;
                q.push(j);
            }
        }
    }
    puts(f[1] == 1 ? "Alice" : f[1] ? "Bob" : "Draw");
    return 0;
}