#include<iostream>

 #include<string>

 #include<cstring>

 #include<algorithm>

 #include<queue>

 #include<cstdio>

 using namespace std;

 const int maxn=+;

 int n,p,k;

 int a[maxn];

 int SG[maxn];

 int vis[maxn];

 int main()

 {

     //freopen("D:\\input.txt", "r", stdin);

     while(~scanf("%d%d",&p,&k))

     {

         int pre=;

         for(int kase=;kase<p;kase++)

         {

             memset(SG,,sizeof(SG));

             scanf("%d",&n);

             for(int i=;i<=n;i++)

                 scanf("%d",&a[i]);

             if(a[]==)  SG[]=;

             else SG[]=;

             for(int i=;i<=n;i++)

             {

                 memset(vis,,sizeof(vis));

                 for(int j=;j<=k && i-j>;j++)

                 {

                     if(i-j-a[i-j]>=)

                         vis[SG[i-j-a[i-j]]]=;

                 }

                 for(int j=;;j++)

                 {

                     if(!vis[j])

                     {

                         SG[i]=j;

                         break;

                     }

                 }

             }

             pre^=SG[n];

         }

         if(pre)  puts("Alice can win.");

         else puts("Bob will win.");

     }

     return ;

 }