#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LLONG_MAX / 4;
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define all(a) begin(a), end(a)
template <class T> bool chmin(T &a, T b) {
  if (a <= b)
    return 0;
  a = b;
  return 1;
}
template <class T> bool chmax(T &a, T b) {
  if (a >= b)
    return 0;
  a = b;
  return 1;
}

pair<ll, char> first_move(vector<ll> a, ll t) {
  const ll n = a.size();
  assert(n >= 2);
  if (t == 0) {
    if (n % 2 == 0) {
      // take last move, want to make 0
      // return with at least one 0
      if (a[0] * a[1] == 1) {
        return {1, '+'};
      } else {
        return {1, '*'};
      }
    } else {
      // opponent takes last move, want to make 0
      // 1?1?1 -> lose
      bool ok = false;
      for (ll i = 0; i < n; i += 2) {
        if (a[i] == 0)
          ok = true;
      }
      if (!ok)
        return {-1, '#'};
      if (a[0] == 0) {
        if (a[n - 2] * a[n - 1] == 1) {
          return {n - 1, '+'};
        } else {
          return {n - 1, '*'};
        }
      } else {
        if (a[0] * a[1] == 1) {
          return {1, '+'};
        } else {
          return {1, '*'};
        }
      }
    }
  } else {
    if (n % 2 == 0) {
      // take last move, want to make 1
      // can make 1?1?1 -> win
      int l = 0, r = n - 1;
      while (l < n && a[l] == 1)
        l += 2;
      while (r >= 0 && a[r] == 1 && l < r)
        r -= 2;
      if (l < r)
        return {-1, '#'};
      if (r - 1 >= 0) {
        if (a[r] == 0) {
          return {r, '+'};
        } else {
          return {r, '*'};
        }
      } else {
        assert(l + 1 < n);
        if (a[l] == 0) {
          return {l + 1, '+'};
        } else {
          return {l + 1, '*'};
        }
      }
    } else {
      // opponent takes last move, want to make 1
      // always lose
      return {-1, '#'};
    }
  }
}

void solve() {
  ll n, t;
  cin >> n >> t;
  vector<ll> a(n);
  for (auto &e : a)
    cin >> e;

  const auto operate = [&](ll i, char op) {
    assert(i >= 1 && i < n);
    assert(op == '+' || op == '*');
    if (op == '+')
      a[i - 1] = (a[i - 1] + a[i]) % 2;
    else
      a[i - 1] = a[i - 1] * a[i];
    a.erase(a.begin() + i);
  };

  bool is_my_turn = true;
  if (first_move(a, t).first != -1) {
    cout << "Alice" << endl;
  } else {
    cout << "Bob" << endl;
    t ^= 1;
    is_my_turn = false;
  }

  while (a.size() >= 2) {
    if (is_my_turn) {
      auto [i, c] = first_move(a, t);
      cout << i << " " << c << endl;
      operate(i, c);
    } else {
      ll i;
      char c;
      cin >> i >> c;
      operate(i, c);
    }
    is_my_turn ^= 1;
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int T = 1;
  // cin >> T;
  while (T--)
    solve();
  return 0;
}