//Shirasu Azusa 2024.5
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii;  
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();} 
  return x*w;
}

const int N=505;
int a[N],n,k,stp;

void work(int pos,char *opt) {
  if(opt[0]=='*') {
    a[pos]=a[pos]&a[pos+1];
  } else {
    a[pos]=a[pos]^a[pos+1];
  }
  rep(j,pos+2,n) a[j-1]=a[j]; n--;
}
void play(int cur,int role,int p) {
  if(cur==1) {
    if(role==1) puts("Alice");
    else puts("Bob");
    fflush(stdout);
  }
  if(n==1) return;
  if((cur&1)==role) {
    int x=0; static char opt[3]; rep(i,0,2) opt[i]=0;
    if(p==1) {
      bool flag=0;
      rep(i,1,n-1) if(a[i]==0&&a[i+1]==0) flag=1, x=i;
      if(!flag) {
        if(a[1]==0) x=1;
        else if(a[n]==0) x=n-1;
        else {
          rep(i,1,n) if(a[i]==1) {
            int j=i; while(j<=n&&a[j]==1) j++; j--;
            if((j-i+1)%2==0) {
              if(i!=1) x=i-1;
              else if(j!=n) x=j;
              break;
            }
            i=j;
          }
        }
      }
      if(!x) opt[0]='*', x=1;
      else opt[0]='+';
    } else {
      bool flag=0;
      rep(i,1,n) if(a[i]==1&&a[i+1]==1) flag=1, x=i;
      if(!flag) rep(i,1,n-1) if(a[i]==1) x=i;
      opt[0]=(flag?'+':'*');
    }
    printf("%lld %s\n",x,opt); fflush(stdout);
    work(x,opt);
  } else {
    int x; char opt[3]; scanf("%lld%s",&x,opt);
    work(x,opt);
  }
  play(cur+1,role,p);
}

signed main() {
  n=read(), k=read();
  rep(i,1,n) a[i]=read();
  rep(i,1,n) {
    if(a[i]==1) stp++;
    if(a[i]&&a[i+1]) i++;
  }
  if(n%2==0) { //Alice dom
    if(k==0) play(1,1,0);
    else {
      int bs=(n-2)/2;
      if(stp<=bs) play(1,0,0);
      else play(1,1,1);
    }
  } else { //Bob dom
    if(k==1) play(1,0,0);
    else {
      int as=(n-1)/2;
      if(stp<=as) play(1,1,0);
      else play(1,0,1);
    }
  }
  return 0;
}