#include<stdio.h>
int u[200005], v[200005];
int h[200005], l, z;
int comp_h(int a, int b)
{
	if (z == 0)
	{
		if (u[h[a]] > u[h[b]])
			return 1;
		else
			return -1;
	}
	else
	{
		if (v[h[a]] > v[h[b]])
			return 1;
		else
			return -1;
	}
}
void swap_h(int a, int b)
{
	int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(int ne)
{
	h[l] = ne;
	int p = l++;
	for (; p > 0; p = (p - 1) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
int pop()
{
	swap_h(0, --l);
	int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
int id1[200005], id2[200005];
int dp[200005];
int deg[200005];
int stack[200005], ss;
int main()
{
	int n, m;
	scanf("%d %d", &n, &m);
	int i;
	for (i = 0; i < m; i++)
	{
		scanf("%d %d", &u[i], &v[i]);
		u[i]--;
		v[i]--;
	}
	z = 0;
	l = 0;
	for (i = 0; i < m; i++)
		push(i);
	for (i = 0; i < m; i++)
		id1[i] = pop();
	id1[m] = m;
	u[m] = -1;
	z = 1;
	l = 0;
	for (i = 0; i < m; i++)
		push(i);;
	for (i = 0; i < m; i++)
		id2[i] = pop();
	id2[m] = m;
	for (i = 0; i < n; i++)
		dp[i] = 0;
	for (i = 0; i < n; i++)
		deg[i] = 0;
	for (i = 0; i < m; i++)
		deg[u[i]]++;
	int min, mid, max;
	for (i = 0; i < n; i++)
		if (deg[i] == 0)
			stack[ss++] = i;
	while (ss > 0)
	{
		i = stack[--ss];
		min = -1;
		max = m;
		while (max - min > 1)
		{
			mid = (max + min) / 2;
			if (u[id1[mid]] < i)
				min = mid;
			else
				max = mid;
		}
		dp[i] = -1;
		for (; u[id1[max]] == i; max++)
		{
			if (dp[v[id1[max]]] < 0)
				dp[i] = 1;
		}
		min = -1;
		max = m;
		while (max - min > 1)
		{
			mid = (max + min) / 2;
			if (v[id2[mid]] < i)
				min = mid;
			else
				max = mid;
		}
		if (dp[i] > 0)
		{
			for (; v[id2[max]] == i; max++)
			{
				deg[u[id2[max]]]--;
				if (deg[u[id2[max]]] == 0 && dp[u[id2[max]]] == 0)
					stack[ss++] = u[id2[max]];
			}
		}
		else
		{
			for (; v[id2[max]] == i; max++)
			{
				deg[u[id2[max]]]--;
				if (dp[u[id2[max]]] == 0)
					stack[ss++] = u[id2[max]];
			}
		}
	}
	if (dp[0] > 0)
		printf("Alice\n");
	else if (dp[0] == 0)
		printf("Draw\n");
	else
		printf("Bob\n");
	return 0;
}