#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<int D, typename T>struct vec : public vector<vec<D - 1, T>> {template<typename... Args>vec(int n = 0, Args... args) : vector<vec<D - 1, T>>(n, vec<D - 1, T>(args...)) {}};
template<typename T>struct vec<1, T> : public vector<T> {vec(int n = 0, T val = T()) : vector<T>(n, val) {}};
template<class T1,class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const deque<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
int ri(){int x;scanf("%i",&x);return x;}
void rd(int&x){scanf("%i",&x);}
void rd(long long&x){scanf("%lld",&x);}
void rd(double&x){scanf("%lf",&x);}
void rd(long double&x){scanf("%Lf",&x);}
void rd(string&x){cin>>x;}
void rd(char*x){scanf("%s",x);}
template<typename T1,typename T2>void rd(pair<T1,T2>&x){rd(x.first);rd(x.second);}
template<typename T>void rd(vector<T>&x){for(T&p:x)rd(p);}
template<typename C,typename...T>void rd(C&a,T&...args){rd(a);rd(args...);}
//istream& operator>>(istream& is,__int128& a){string s;is>>s;a=0;int i=0;bool neg=false;if(s[0]=='-')neg=true,i++;for(;i<s.size();i++)a=a*10+s[i]-'0';if(neg)a*=-1;return is;}
//ostream& operator<<(ostream& os,__int128 a){bool neg=false;if(a<0)neg=true,a*=-1;ll high=(a/(__int128)1e18);ll low=(a-(__int128)1e18*high);string res;if(neg)res+='-';if(high>0){res+=to_string(high);string temp=to_string(low);res+=string(18-temp.size(),'0');res+=temp;}else res+=to_string(low);os<<res;return os;}

int solveOdd(int t, vector<int> &a){ // O(n)
	if(sz(a)==1){
		if(t==0){
			if(a[0]%2==0){
				return 0;
			}
			return 1;
		}
		else{
			if(a[0]%2==1){
				return 0;
			}
			return 1;
		}
	}
	if(t==1)return 1; // Bob wins
	int cntChain=-1;
	for(auto p:a){
		if((p%2)==0){
			if(cntChain==-1){
				cntChain=0;
				continue;
			}
			if(cntChain%2==0){
				return 0; // Alice wins
			}
			cntChain=0;
		}
		else{
			if(cntChain==-1){
				cntChain=0;
			}
			cntChain++;
		}
	}
	return 1; // Bob wins
}
vector<int> applyOp(vector<int> &a,int pos,char op){ // O(N)
	vector<int> ans;
	ans.reserve(sz(a)-1);
	for(int i=0;i<sz(a);i++){
		if((i+1)==pos){
			if(op=='+'){
				ans.pb((a[i]+a[i+1])%2);
			}
			else{
				ans.pb((a[i]*a[i+1])%2);
			}
			i++;
		}
		else{
			ans.pb(a[i]);
		}
	}
	return ans;
}
vector<char> ops={'+','*'};
int solveEven(int t,vector<int> &a){ // O(n^2)
	if(t==0)return 0;
	for(int i=1;i<sz(a);i++){
		for(auto p:ops){
			vector<int> sl=applyOp(a,i,p);
			if(solveOdd(t^1,sl)==1){
				return 0;
			}
		}
	}
	return 1;
}
int solve(int t,vector<int> &a){ //O(n^2)
	if(sz(a)%2==1){
		return solveOdd(t,a);
	}
	return solveEven(t,a);
}
int main()
{
	int n=ri(),t=ri();
	vector<int> a(n);
	rd(a);
	if(solve(t,a)){
		printf("Bob\n");
		fflush(stdout);
		int x;
		string s;
		cin >> x >> s;
		a=applyOp(a,x,s[0]);
		t^=1;
	}
	else{
		printf("Alice\n");
		fflush(stdout);
	}
	while(sz(a)!=1){
		// if sz(a)%2 == 0 -> play according to rules
		// This means that its N odd, we are first and we win ()
		if(sz(a)%2==1){
			bool ok=0;
			for(int i=1;i<sz(a);i++){
				if(a[i]==1&&a[i-1]==1){
					printf("%i +\n",i);
					fflush(stdout);
					a=applyOp(a,i,'+');
					ok=1;
					break;
				}
			}
			if(!ok){
				for(int i=1;i<sz(a);i++){
					if(a[i]!=a[i-1]){
						printf("%i *\n",i);
						fflush(stdout);
						a=applyOp(a,i,'*');
						ok=1;
						break;
					}
				}
				if(!ok){
					assert(0);
				}
			}
		}
		else{
			bool ok=0;
			for(int i=1;i<sz(a);i++){
				if(a[i]!=a[i-1]){
					printf("%i +\n",i);
					fflush(stdout);
					a=applyOp(a,i,'+');
					ok=1;
					break;
				}
			}
			if(!ok){
				printf("1 +\n");
				fflush(stdout);
				a=applyOp(a,1,'+');
			}
		}
		if(sz(a)==1)break;
		int x;
		string s;
		cin >> x >> s;
		a=applyOp(a,x,s[0]);
	}
	return 0;
}