//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#include <bits/stdc++.h>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef KIVI
#define DEBUG for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define DEBUG while (false)
#define LOG(...)
#endif

mt19937 rng(4242);

const int max_n = -1, inf = 1000111222;

int get_mex(vector<int>& a) {
    int am = len(a) + 3;
    vector<int> have(am);
    for(auto& x : a) if(x < am) have[x] = 1;
    int mex = 0;
    while(have[mex]) mex++;
    return mex;
}

void solve() {
    int p, k;
    cin >> p >> k;
    int ans = 0;
    for(int i = 0; i < p; i++) {
        int n; cin >> n;
        vector<int> c(n + 1);
        for(int j = 1; j <= n; j++) cin >> c[j];
        vector<int> state(n + 1);
        for(int j = 1; j <= n; j++) {
            vector<int> transitions;
            for(int take_top = 0; take_top <= k && take_top < j; take_top++) {
                int card = c[j - take_top];
                if(j - take_top - card >= 0) transitions.pb(state[j - take_top - card]);
            }
            state[j] = get_mex(transitions);
        }
        ans ^= state[n];
    }
    if(!ans) cout << "Bob will win.";
    else cout << "Alice can win.";
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;

//    cin >> t;

    while (t--) solve();

}

/*
KIVI
*/