#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
template<typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template<typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;
#define sz 555

int n,t;
int a[sz];

unsigned long long seed = time(0) + (size_t)(new char);
mt19937 rng(seed);

void input() {
    int p; char op;
    #ifndef zqj
    cin>>p;
    cin>>op;
    #else
    p = rng()%2;
    op = "+*"[rng()%2];
    #endif
    if (op=='+') a[p]^=a[p+1];
    else a[p]&=a[p+1];
    rep(i,p+1,n-1) a[i]=a[i+1];
}

void workodd(int self) {
    int cur=0;
    while (n!=1) {
        if (cur==self) {
            static int b[sz];
            rep(i,1,n-1) {
                rep(j,1,i-1) b[j]=a[j];
                b[i]=1;
                rep(j,i+2,n) b[j-1]=a[j];
                int ok=1;
                for (int i=1;i<=n;i+=2) ok&=b[i];
                if (ok) {
                    cout<<i<<' '<<"*+"[a[i]!=a[i+1]]<<'\n';
                    rep(i,1,n-1) a[i]=b[i];
                    break;
                }
            }
        }
        else input();
        --n; cur^=1;
    }
    assert(a[1]==1);
    exit(0);
}

void workeven(int self) {
    int cur=0;
    while (n!=1) {
        if (cur==self) {
            for (int i=1;i<=n;i+=2) if (!a[i]) {
                if (i==1) {
                    cout<<2<<' '<<"*+"[a[2]==a[3]]<<'\n';
                    a[i+1]=0;
                    rep(j,i+3,n) a[j-1]=a[j];
                }
                else {
                    cout<<i-2<<' '<<"*+"[a[i-2]==a[i-1]]<<'\n';
                    a[i-2]=0;
                    rep(j,i,n) a[j-1]=a[j];
                }
                break;
            }
        }
        else input();
        --n; cur^=1;
    }
    assert(a[1]==0);
    exit(0);
}


int main() {
    #ifndef zqj
    cin>>n>>t;
    rep(i,1,n) cin>>a[i];
    #else
    n = rng() % 60 + 1;
    t = rng() % 2;
    rep(i,1,n) a[i] = rng() % 2;
    cerr<<seed<<'\n';
    #endif
    if (n%2==t) {
        cout<<(t?"Bob":"Alice")<<'\n';
        int cur=0;
        while (n!=1) {
            if (cur==t) {
                cout<<n-1<<' ';
                if (a[n-1]==a[n]) cout<<"+\n";
                else cout<<"*\n";
                a[n-1]=0;
            }
            else input();
            cur^=1; --n;
        }
        assert(a[1]==0);
        return 0;
    }
    if (t==0) {
        int ok=1;
        for (int i=1;i<=n;i+=2) ok&=a[i];
        if (ok) {
            cout<<"Bob\n";
            workodd(1);
        }
        else {
            cout<<"Alice\n";
            workeven(0);
        }
    }
    else {
        static int b[sz];
        rep(i,1,n-1) {
            rep(j,1,i-1) b[j]=a[j];
            b[i]=0;
            rep(j,i+2,n) b[j-1]=a[j];
            int ok=1;
            for (int i=1;i<=n;i+=2) ok&=b[i];
            cout<<"Alice\n";
            workodd(0);
        }
        cout<<"Bob\n";
        workeven(1);
    }
    return 0;
}