// -fsanitize=undefined,
// #define _GLIBCXX_DEBUG


#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <random>
#include <stdio.h>
#include <fstream>
#include <functional>
#include <cassert>
#include <unordered_map>
#include <bitset>
#include <chrono>

#include <algorithm>

#include <vector>

namespace atcoder {

namespace internal {

template <class T> struct simple_queue {
    std::vector<T> payload;
    int pos = 0;
    void reserve(int n) { payload.reserve(n); }
    int size() const { return int(payload.size()) - pos; }
    bool empty() const { return pos == int(payload.size()); }
    void push(const T& t) { payload.push_back(t); }
    T& front() { return payload[pos]; }
    void clear() {
        payload.clear();
        pos = 0;
    }
    void pop() { pos++; }
};

}  // namespace internal

}  // namespace atcoder

#include <cassert>
#include <limits>
#include <queue>
#include <vector>

namespace atcoder {

template <class Cap> struct mf_graph {
  public:
    mf_graph() : _n(0) {}
    mf_graph(int n) : _n(n), g(n) {}

    int add_edge(int from, int to, Cap cap) {
        assert(0 <= from && from < _n);
        assert(0 <= to && to < _n);
        assert(0 <= cap);
        int m = int(pos.size());
        pos.push_back({from, int(g[from].size())});
        int from_id = int(g[from].size());
        int to_id = int(g[to].size());
        if (from == to) to_id++;
        g[from].push_back(_edge{to, to_id, cap});
        g[to].push_back(_edge{from, from_id, 0});
        return m;
    }

    struct edge {
        int from, to;
        Cap cap, flow;
    };

    edge get_edge(int i) {
        int m = int(pos.size());
        assert(0 <= i && i < m);
        auto _e = g[pos[i].first][pos[i].second];
        auto _re = g[_e.to][_e.rev];
        return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};
    }
    std::vector<edge> edges() {
        int m = int(pos.size());
        std::vector<edge> result;
        for (int i = 0; i < m; i++) {
            result.push_back(get_edge(i));
        }
        return result;
    }
    void change_edge(int i, Cap new_cap, Cap new_flow) {
        int m = int(pos.size());
        assert(0 <= i && i < m);
        assert(0 <= new_flow && new_flow <= new_cap);
        auto& _e = g[pos[i].first][pos[i].second];
        auto& _re = g[_e.to][_e.rev];
        _e.cap = new_cap - new_flow;
        _re.cap = new_flow;
    }

    Cap flow(int s, int t) {
        return flow(s, t, std::numeric_limits<Cap>::max());
    }
    Cap flow(int s, int t, Cap flow_limit) {
        assert(0 <= s && s < _n);
        assert(0 <= t && t < _n);
        assert(s != t);

        std::vector<int> level(_n), iter(_n);
        internal::simple_queue<int> que;

        auto bfs = [&]() {
            std::fill(level.begin(), level.end(), -1);
            level[s] = 0;
            que.clear();
            que.push(s);
            while (!que.empty()) {
                int v = que.front();
                que.pop();
                for (auto e : g[v]) {
                    if (e.cap == 0 || level[e.to] >= 0) continue;
                    level[e.to] = level[v] + 1;
                    if (e.to == t) return;
                    que.push(e.to);
                }
            }
        };
        auto dfs = [&](auto self, int v, Cap up) {
            if (v == s) return up;
            Cap res = 0;
            int level_v = level[v];
            for (int& i = iter[v]; i < int(g[v].size()); i++) {
                _edge& e = g[v][i];
                if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;
                Cap d =
                    self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));
                if (d <= 0) continue;
                g[v][i].cap += d;
                g[e.to][e.rev].cap -= d;
                res += d;
                if (res == up) break;
            }
            return res;
        };

        Cap flow = 0;
        while (flow < flow_limit) {
            bfs();
            if (level[t] == -1) break;
            std::fill(iter.begin(), iter.end(), 0);
            while (flow < flow_limit) {
                Cap f = dfs(dfs, t, flow_limit - flow);
                if (!f) break;
                flow += f;
            }
        }
        return flow;
    }

    std::vector<bool> min_cut(int s) {
        std::vector<bool> visited(_n);
        internal::simple_queue<int> que;
        que.push(s);
        while (!que.empty()) {
            int p = que.front();
            que.pop();
            visited[p] = true;
            for (auto e : g[p]) {
                if (e.cap && !visited[e.to]) {
                    visited[e.to] = true;
                    que.push(e.to);
                }
            }
        }
        return visited;
    }

  private:
    int _n;
    struct _edge {
        int to, rev;
        Cap cap;
    };
    std::vector<std::pair<int, int>> pos;
    std::vector<std::vector<_edge>> g;
};

}  // namespace atcoder



using namespace std;
using namespace atcoder;


#define rep(i,n) for (int i=0;i<n;i+=1)
#define rrep(i,n) for (int i=n-1;i>-1;i--)
#define pb push_back
#define all(x) (x).begin(), (x).end()

#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << " )\n";

template<class T>
using vec = vector<T>;
template<class T>
using vvec = vec<vec<T>>;
template<class T>
using vvvec = vec<vvec<T>>;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;


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

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

template<class T>
T sum(vec<T> x){
  T res=0;
  for (auto e:x){
    res += e;
  }
  return res;
}

template<class T>
void printv(vec<T> x){
  for (auto e:x){
    cout<<e<<" ";
  }
  cout<<endl;
}



template<class T,class U>
ostream& operator<<(ostream& os, const pair<T,U>& A){
  os << "(" << A.first <<", " << A.second << ")";
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const set<T>& S){
  os << "set{";
  for (auto a:S){
    os << a;
    auto it = S.find(a);
    it++;
    if (it!=S.end()){
      os << ", ";
    }
  }
  os << "}";
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const vec<T>& A){
  os << "[";
  rep(i,A.size()){
    os << A[i];
    if (i!=A.size()-1){
      os << ", ";
    }
  }
  os << "]" ;
  return os;
}

vector<int> next_A(vector<int> A,int p,char c){
  int n = A.size();
  vector<int> nxt_A;
  rep(i,n){
    if (i!=p && i!=p+1){
      nxt_A.push_back(A[i]);
    }
    else if (i == p){
      if (c == '+'){
        nxt_A.push_back(A[i] ^ A[i+1]);
      }
      else{
        nxt_A.push_back(A[i] & A[i+1]);
      }
    }
  }
  return nxt_A;
}

int simulate(int t,vector<int> A,int player){
  int N = A.size();
  int now = 0;
  for (;A.size() > 2;now ^= 1){
    int n = A.size();
    int p;
    char c;
    if (n & 1){
      if (A[0] == 0){
        if ((A[n-1] ^ A[n-2]) == 0){
          p = n-2; c = '+';
        }
        else{
          p = n-2; c = '&';
        }
      }
      else if (A[n-1] == 0){
        if ((A[0] ^ A[1]) == 0){
          p = 0; c = '+';
        }
        else{
          p = 0; c = '&';
        }
      }
      else{
        p = 0; c = '+';
      }
    }
    else{
      p = 0; c = '+';
      for (int tp=0;tp<n-1;tp++){
        for (auto tc:{'+','*'}){
          auto tmp_nxt_A = next_A(A,tp,tc);
          //debug(tmp_nxt_A);
          int flg = 1;
          for (int i=0;i<tmp_nxt_A.size();i+=2){
            if (tmp_nxt_A[i] == 0){
              flg = 0;
            }
          }
          if (flg){
            p = tp; c = tc;
          }
        }
      }
    }
    A = next_A(A,p,c);
    //debug(A);
  }

  if (now == player){
    if (player == 0){
      if ((A[0] ^ A[1]) == t){
        return 1;
      }
      if ((A[0] & A[1]) == t){
        return 1;
      }
      return 0;
    }
    else{
      if ((A[0] ^ A[1]) != t){
        return 1;
      }
      if ((A[0] & A[1]) != t){
        return 1;
      }
      return 0;
    }
  }
  else{
    if (player == 0){
      if ((A[0] ^ A[1]) != t){
        return 0;
      }
      if ((A[0] & A[1]) != t){
        return 0;
      }
      return 1;
    }
    else{
      if ((A[0] ^ A[1]) == t){
        return 0;
      }
      if ((A[0] & A[1]) == t){
        return 0;
      }
      return 1;
    }
  }
}


void solve(){
  int N,t;
  cin>>N>>t;
  vec<int> A(N);
  rep(i,N) cin>>A[i];

  int me = 0;

  if (simulate(t,A,1)){me = 1;}

  if (me == 0){
    cout << "Alice" << endl;
  }
  else{
    cout << "Bob" << endl;
  }

  int judge = me ^ 1;
  int now = 0;
  for (;A.size() > 2;now ^= 1){
    int n = A.size();
    if (now == judge){
      int p; char c;
      cin>>p>>c;
      p--;
      A = next_A(A,p,c);
      continue;
    }

    int p;
    char c;
    
    if (n & 1){
      if (A[0] == 0){
        if ((A[n-1] ^ A[n-2]) == 0){
          p = n-2; c = '+';
        }
        else{
          p = n-2; c = '*';
        }
      }
      else if (A[n-1] == 0){
        if ((A[0] ^ A[1]) == 0){
          p = 0; c = '+';
        }
        else{
          p = 0; c = '*';
        }
      }
      else{
        p = 0; c = '+';
      }
    }
    else{
      p = 0; c = '+';
      for (int tp=0;tp<n-1;tp++){
        for (auto tc:{'+','*'}){
          auto tmp_nxt_A = next_A(A,tp,tc);
          int flg = 1;
          for (int i=0;i<tmp_nxt_A.size();i+=2){
            if (tmp_nxt_A[i] == 0){
              flg = 0;
            }
          }
          if (flg){
            p = tp; c = tc;
          }
        }
      }
    }

    cout << p+1 << " " << c << endl;
    A = next_A(A,p,c);
  }

  if (now == me){
    if ((A[0] ^ A[1]) == (t ^ me)){
      cout << "1" << " " << "+" << endl;
    }
    else{
      cout << "1" << " " << "*" << endl;
    }
  }
  else{
    int p; char c;
    cin>>p>>c;
  }



}



int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int T;
  T = 1;
  while (T--){
    solve();
  }

  
  
}