#include <bits/stdc++.h>
#define For(i,l,r) for(int i=l; i<=r; i++)
#define per(i,r,l) for(int i=r; i>=l; i--)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;
bool a[505],aa[505]; int n,t;
void work(int x,int ty){ //0: +; 1: *
    if (ty==0) a[x]=a[x]^a[x+1];
    else a[x]=a[x]&a[x+1];
    For(i,x+1,n-1) a[i]=a[i+1];
    --n;
}
bool ch1(){
    bool fl=1;
    for(int i=1;i<=n;i+=2) fl=fl&a[i];
    return fl;
}
void pa(){printf("Alice\n");}
void pb(){printf("Bob\n");}
void pr(int x,int ty){
    if (!ty) printf("%d +\n",x);
    else printf("%d *\n",x);//ty==0?'+':'*');}
    work(x,ty); //cout<<n<<endl;
    fflush(stdout);
    if (n==1) exit(0);
}
void make0(int x){
    if ((a[x]&a[x+1])==1) pr(x,0);
    else pr(x,1);
}
void input(){
    //cout<<"##";
    char ch[5]; int x;
    cin>>x>>ch;
    int ty=0; if (ch[0]=='*') ty=1;
    work(x,ty); //fflush(stdout);
    if (n==1) exit(0);
    //return make_pair(x,ty);
}
int main(){
    cin>>n>>t;
    For(i,1,n) cin>>a[i];
    //Alice,0
    if (n%2==0&&t==0){
        pa();
        while(n>2){
            pr(1,0);
            input();
        }
        make0(1);
    }
    //Bob,1
    if (n%2==1&&t==1){
        pb(); input();
        while(n>2){
            pr(1,0);
            input();
        }
        make0(1);
    }
    //Bob,0
    if (n%2==1&&t==0){
        if (ch1()){ // last win
            pb(); input();
            while(n>1){
                memcpy(aa,a,sizeof(aa));
                //For(i,1,n) printf("%d",a[i]);
                For(i,1,n-1) For(j,0,1){
                    work(i,j);
                    if (ch1()){
                        memcpy(a,aa,sizeof(a)); ++n;
                        pr(i,j); goto E1;
                    }
                    memcpy(a,aa,sizeof(a)); ++n;
                }
                E1:;
                input();
            }
        }
        else{ //last lose
            pa();
            while(n>1){
                //find 0
                int x;
                for(int i=1;i<=n;i+=2) if (!a[i]) {x=i; break;}
                if (x<n) make0(x+1);
                else make0(x-2);
                input();
            }
        }
    }
    //alice,1
    if (n%2==0&&t==1){
        //find
        memcpy(aa,a,sizeof(aa));
        For(i,1,n-1) For(j,0,1){
            work(i,j); //cout<<i<<' '<<j<<' '<<n<<endl;
            if (ch1()){
                memcpy(a,aa,sizeof(a)); ++n;
                pa(); pr(i,j); goto E2;
            }
            memcpy(a,aa,sizeof(a)); ++n;
        }
        //last lose
        pb(); input();
        while(n>1){
            //find 0
            int x;
            for(int i=1;i<=n;i+=2) if (!a[i]) {x=i; break;}
            if (x<n) make0(x+1);
            else make0(x-2);
            input();
        }
        exit(0);
        //last win
        E2:;
        while(n>1){
            input(); memcpy(aa,a,sizeof(aa));
            For(i,1,n-1) For(j,0,1){
                work(i,j);
                if (ch1()){
                    memcpy(a,aa,sizeof(a)); ++n;
                    pr(i,j); goto E3;
                }
                memcpy(a,aa,sizeof(a)); ++n;
            }
            E3:;
        }
    }
    return 0;
}