#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const int Mod = 998244353;
int sign(int a){ return (a&1) ? (Mod-1) : 1; }
void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 10010;
int fact[fN], invfact[fN], inv[fN];
void initfact(int n){
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }

int n, t;
vi a;

void op(int p, char tp){
	vi v;
	rep(i, p) v.push_back(a[i]);
	v.push_back((tp == '*') ? (a[p] * a[p+1]) : (a[p] ^ a[p+1]));
	for(int i = p+2; i < n; ++i) v.push_back(a[i]);
	a = v;
	n = (int)a.size();
}

inline void do_op(int p, char tp){
	cout << p+1 << " " << tp << endl;
	op(p, tp);
}

inline void del(int p){
	int id = max(0, p - 1);
	if(a[p] == 0){
		do_op(id, '+');
	} else {
		do_op(id, '*');
	}
}

void read_op(){
	int p; char tp;
	cin >> p >> tp, --p;
	op(p, tp);
}

void solve_win(int my){
	cout << (my ? "Bob" : "Alice") << endl;
	int rnd = 0;
	while(n > 2){
		if(rnd == my){
			do_op(0, '+');
		} else {
			read_op();
		}
		rnd ^= 1;
	}
	assert(rnd == my);
	if(a[0] == 1 && a[1] == 1) cout << "1 +" << endl;
	else if(a[0] == 1) del(0);
	else if(a[1] == 1) del(1);
	else del(0);
}

bool check(vi &v){
	bool can = 1;
	rep(i, (int)v.size() - 1) if(v[i] == 0 && v[i+1] == 0) can = 0;
	if(v[0] == 0 || v[(int)v.size() - 1] == 0) can = 0;
	rep(i, (int)v.size()){
		if(v[i] == 1){
			int j = i;
			for(; j < (int)v.size() && v[j] == 1; ++j);
			if((j - i) % 2 == 0) can = 0;
			i = j-1;
		}
	}
	return can;
}

void solve_0(){
	while(n > 1){
		if(n % 2 == 1){
			assert(!check(a));
			bool done = 0;
			rep(i, n-1) if(a[i] == 1 && a[i+1] == 1){
				do_op(i, '+'), done = 1;
				break;
			}
			if(!done) rep(i, n) if(a[i] == 1){
				del(i), done = 1;
				break;
			}
			if(!done) del(0);
		} else {
			read_op();
		}
	}
}

void solve_1(){
	while(n > 2){
		if(n % 2 == 1){
			read_op();
		} else {
			rep(i, n){
				vi tmp;
				rep(j, n) if(j != i) tmp.push_back(a[j]);
				if(check(tmp)){ del(i); break; }
			}
		}
	}
	assert(a[0] == 1 || a[1] == 1);
	if(a[0] == 1) del(1);
	else del(0);
}

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

	cin >> n >> t;
	a.resize(n);
	rep(i, n) cin >> a[i];

	if(n % 2 == t){
		solve_win(t);
	} else {
		if(t == 1){
			rep(i, n){
				vi tmp;
				rep(j, n) if(j != i) tmp.push_back(a[j]);
				if(check(tmp))
					return cout << "Alice" << endl, del(i), solve_1(), 0;
			}
			cout << "Bob" << endl;
			read_op();
			solve_0();
		} else {
			if(check(a))
				cout << "Bob" << endl, solve_1();
			else
				cout << "Alice" << endl, solve_0();
		}
	}

	return 0;
}