#include <bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ull = unsigned long long;
using ld = long double;

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

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

using namespace std;

vector<int> process(vector<int> v, int i, char c){
    int x = v[i];
    int y = v[i+1];
    int z = (c == '+' ? (x^y) : (x&y));
    v.erase(v.begin()+i,v.begin()+i+2);
    v.insert(v.begin()+i,z);
    return v;
}

char which(int x, int y, int z){
    if (z == 0){
        if (x == 0 || y == 0) return '*';
        else return '+';
    }
    else {
        assert(x != 0 || y != 0);
        if (x == 0 || y == 0) return '+';
        else return '*';
    }
}

bool is_lose_pattern(const vector<int> &a){
    int n = a.size();
    assert(n % 2 == 1);
    rep(i,0,n){
        if (i % 2 == 0 && a[i] != 1){
            return false;
        }
    }
    return true;
}

int nxtz(int x, int y, char c){
    return (c == '+' ? (x^y) : (x&y));
}

pair<int,char> can_move_to_lose(const vector<int> &a){
    int n = a.size();
    int p = -1;
    char c = '?';
    vector<int> rui0(n+1,0), rui1(n+1,0);
    rep(i,0,n){
        rui0[i+1] = rui0[i];
        rui1[i+1] = rui1[i];
        (i % 2 == 0 ? rui0[i+1] : rui1[i+1]) += 1 - a[i];
    }
    auto fast_is_lose_pattern = [&](int i, int z){
        int le = rui0[i];
        int ri = rui1[n] - rui1[i+2];
        int sum = le + ri + (i % 2 == 0 && z == 0 ? 1 : 0);
        return sum == 0;
    };
    rep(i,0,n-1){
        if (fast_is_lose_pattern(i,nxtz(a[i],a[i+1],'+'))){
            p = i, c = '+';
            break;
        }
        if (fast_is_lose_pattern(i,nxtz(a[i],a[i+1],'*'))){
            p = i, c = '+';
            break;
        }
    }
    return make_pair(p,c);
}

pair<int,char> strategy(vector<int> a){
    int n = a.size();
    int p = -1;
    char c = '?';
    rep(i,0,n-1){
        auto na = process(a,i,'+');
        if (can_move_to_lose(na).first == -1){
            p = i, c = '+';
            break;
        }
        auto ma = process(a,i,'*');
        if (can_move_to_lose(ma).first == -1){
            p = i, c = '*';
            break;
        }
    }
    return make_pair(p,c);
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    int n, t; cin >> n >> t;
    vector<int> a(n);
    rep(i,0,n) cin >> a[i];
    auto ask = [&](int p, char c){
        cout << p+1 << ' ' << c << endl;
        a = process(a,p,c);
        n--;
    };
    auto hear = [&](){
        int p; cin >> p; p--;
        char c; cin >> c;
        a = process(a,p,c);
        n--;
    };
    if (n % 2 == 0 && t == 0){
        cout << "Alice" << endl;
        while (n > 2){
            ask(0,'+');
            hear();
        }
        ask(0,which(a[0],a[1],0));
        return 0;
    }
    if (n % 2 == 1 && t == 1){
        cout << "Bob" << endl;
        hear();
        while (n > 2){
            ask(0,'+');
            hear();
        }
        ask(0,which(a[0],a[1],0));
        return 0;
    }
    if (n % 2 == 1){
        if (is_lose_pattern(a)){
            cout << "Bob" << endl;
            while (n > 1){
                hear();
                auto [p, c] = can_move_to_lose(a);
                assert(p != -1);
                ask(p,c);
            }
            return 0;
        }
        else {
            cout << "Alice" << endl;
            while (n > 1){
                auto [p, c] = strategy(a);
                assert(p != -1);
                ask(p,c);
                hear();
            }
            return 0;
        }
    }
    else {
        auto [ip, ic] = can_move_to_lose(a);
        if (ip != -1){
            cout << "Alice" << endl;
            ask(ip,ic);
            while (n > 1){
                hear();
                auto [p, c] = can_move_to_lose(a);
                assert(p != -1);
                ask(p,c);
            }
            return 0;
        }
        else {
            cout << "Bob" << endl;
            hear();
            while (n > 1){
                auto [p, c] = strategy(a);
                assert(p != -1);
                ask(p,c);
                hear();
            }
            return 0;
        }
    }
}