#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector to(n, vector<int>());
	vector toR(n, vector<int>());
	vector<int>cnt(n);
	rep(i, m) {
		int u, v; cin >> u >> v, u--, v--;
		to[u].push_back(v);
		toR[v].push_back(u);
		cnt[u]++;
	}
	queue<int>q;
	vector<int>st(n, 0);
	rep(i, n)if (!cnt[i]) {
		q.push(i);
		st[i] = -1;//lose
	}

	while (!q.empty()) {
		auto v = q.front();
		q.pop();
		for (auto u : toR[v]) {
			if (st[u] != 0)continue;
			cnt[u]--;
			if (st[v] == -1) {
				st[u] = 1;
				q.push(u);
				continue;
			}
			if (cnt[u] == 0) {
				st[u] = -1;
				q.push(u);
				continue;
			}
		}
	}
	if (st[0] == 1)cout << "Alice" << endl;
	else if (st[0] == 0)cout << "Draw" << endl;
	else cout << "Bob" << endl;
	return 0;
}