#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

vector<int> mv(const vector<int>& a, int i, bool f) {
    vector<int> b(a.size() - 1);
    for (int j = 0; j < i; ++j) {
        b[j] = a[j];
    }
    if (f) {
        b[i] = (a[i] + a[i + 1]) & 1;
    } else {
        b[i] = a[i] * a[i + 1];
    }
    for (int j = i + 1; j < (int)b.size(); ++j) {
        b[j] = a[j + 1];
    }
    return b;
}

pair<int, bool> input() {
    int i;
    char ch;
    cin >> i >> ch;
    return {i - 1, ch == '+'};
}

void out(int i, bool f) {
    cout << i + 1 << " ";
    if (f) {
        cout << "+";
    } else {
        cout << "*";
    }
    cout << endl;
}

bool check(const vector<int>& a) {
    int k = 0;
    int n = a.size();
    for (int i = 0; i < n; ++i) {
        if (a[i] == 0) continue;
        ++k;
        if (i + 1 < n && a[i + 1] == 1) ++i;
    }
    return k <= (n - 1) / 2;
}

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

    int n, t;
    cin >> n >> t;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    if (n % 2 == t) {
        if (t == 0) {
            cout << "Alice" << endl;
        } else {
            cout << "Bob" << endl;
            auto res = input();
            a = mv(a, res.first, res.second);
        }
        while (a.size() > 2) {
            out(0, true);
            a = mv(a, 0, true);
            auto res = input();
            a = mv(a, res.first, res.second);
        }
        if (a[0] == 0 || a[1] == 0) {
            out(0, false);
        } else {
            out(0, true);
        }
        return 0;
    }

    auto res = check(a);
    if (res == t) {
        cout << "Bob" << endl;
        auto res = input();
        a = mv(a, res.first, res.second);
    } else {
        cout << "Alice" << endl;
    }

    while (a.size() > 1) {
        bool moved = false;
        for (int i = 0; i + 1 < (int)a.size() && !moved; ++i) {
            for (int f = 0; f < 2 && !moved; ++f) {
                auto a1 = mv(a, i, f);
                if (check(a1) == res) {
                    moved = true;
                    out(i, f);
                    a = a1;
                    if (a.size() > 1) {
                        auto res = input();
                        a = mv(a, res.first, res.second);
                    }
                }
            }
        }
    }

    
    return 0;
}