#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first 
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

int solve(int k)
{
	int n;
	cin >> n;
	VI a(n);
	VI dp(n + 1);
	dp[0] = 0;
	
	FOR(i, 0, n)
	{
		cin >> a[i];
		VI vals;
		FOR(j, 0, min(k, i) + 1)
		{
			int pos = i - j - a[i - j] + 1;
			if(pos >= 0)
				vals.PB(dp[pos]);
		}
		sort(ALL(vals));
		int me = 0;
		FOR(j, 0, SZ(vals))
			if(vals[j] == me)
				me++;
		
		dp[i + 1] = me;
	}
	return dp[n];
}


int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n, k;
	cin >> n >> k;
	int val = 0;
	FOR(i, 0, n)
		val ^= solve(k);
	
	if(val == 0)
		cout << "Bob will win.\n";
	else
		cout << "Alice can win.\n";
	
	return 0;
}