#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


string oper(const string &s, int i, char op) {
  const int a = s[i] - '0';
  const int b = s[i + 1] - '0';
  const int c = (op == '+') ? ((a + b) & 1) : ((a * b) & 1);
  return s.substr(0, i) + "01"[c] + s.substr(i + 2);
}

int solve(int t, const string &s) {
  const int n = s.size();
  int ret;
  if (t) {
    if (n & 1) {
      if (n == 1) {
        ret = s[0] - '0';
      } else {
        ret = 0;
      }
    } else {
      ret = 1;
    }
  } else {
    if (n & 1) {
      ret = 0;
      for (int i = 0; i < n; i += 2) if (s[i] != '1') {
        ret = 1;
        break;
      }
    } else {
      int a = 0, b = 0;
      for (int i = 0; i < n && s[i] == '1'; i += 2) ++a;
      for (int i = n - 1; i > 0 && s[i] == '1'; i -= 2) ++b;
      ret = (a + b >= n/2) ? 1 : 0;
    }
  }
  return ret;
}

void expr() {
  constexpr int lim = 16;
  for (int t = 0; t < 2; ++t) {
    vector<vector<int>> dp(lim + 1);
    dp[1] = {(t == 0), (t == 1)};
    for (int n = 2; n <= lim; ++n) {
      dp[n].assign(1 << n, 0);
      for (int p = 0; p < 1 << n; ++p) {
        for (int i = 0; i < n - 1; ++i) {
          const int a = (p >> i & 1);
          const int b = (p >> (i+1) & 1);
          for (const int c : {(a + b) & 1, (a * b) & 1}) {
            int pp = 0;
            pp |= p & ((1 << i) - 1);
            pp |= c << i;
            pp |= p >> (i + 2) << (i + 1);
            if (!dp[n - 1][pp]) {
              dp[n][p] = 1;
            }
          }
        }
      }
    }
    /*
    for (int n = 1; n <= lim; ++n) {
      int cnt = 0;
      for (int p = 0; p < 1 << n; ++p) {
        string s(n, '?');
        for (int i = 0; i < n; ++i) s[i] = "01"[p >> i & 1];
        if (!dp[n][p]) {
          ++cnt;
          cout << t << " " << s << endl;
        }
      }
      cerr << t << " " << n << ": " << cnt << endl;
    }
    */
    for (int n = 1; n <= lim; ++n) {
      for (int p = 0; p < 1 << n; ++p) {
        string s(n, '?');
        for (int i = 0; i < n; ++i) s[i] = "01"[p >> i & 1];
        const int slv = solve(t, s);
        if (dp[n][p] != slv) {
          cerr << "FAIL " << n << " " << s << ": " << dp[n][p] << " " << slv << endl;
        }
        assert(dp[n][p] == slv);
      }
    }
  }
}

int main() {
  // expr();
  
  int N, T;
  scanf("%d%d", &N, &T);
  vector<int> A(N);
  for (int i = 0; i < N; ++i) {
    scanf("%d", &A[i]);
  }
  
  const int t = T ^ ((N - 1) & 1);
  string s(N, '?');
  for (int i = 0; i < N; ++i) s[i] = "01"[A[i]];
  
  bool win = solve(t, s);
  puts(win ? "Alice" : "Bob");
  fflush(stdout);
  
  for (; ; ) {
    const int n = s.size();
    if (n == 1) {
      break;
    }
    if (win) {
      for (int i = 0; i < n - 1; ++i) {
        for (const char op : {'+', '*'}) {
          const string ss = oper(s, i, op);
          if (!solve(t, ss)) {
            printf("%d %c\n", i + 1, op);
            fflush(stdout);
            s = ss;
            win = !win;
            goto found;
          }
        }
      }
      assert(false);
     found:{}
    } else {
      int i;
      scanf("%d", &i);
      if (i == 0) {
        // WA
        exit(0);
      }
      --i;
      char op;
      scanf(" %c", &op);
      s = oper(s, i, op);
      win = !win;
    }
  }
  
  return 0;
}