#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int n, t;
int a[N];
int f(int x) {
    int p = 0, len = 0;
    for (int i = 1; i <= x; ++i) {
        if (a[i] == 0) {
            p += len % 2;
            len = 0;
            --p;
        } else
            ++len;
    }
    return p + len % 2;
}
char s[10];

void mv(int x) {
    for (int i = x; i < n; ++i)
        a[i] = a[i + 1];
}
void moni() {
    int p;
    scanf("%d%s", &p, s);
    if (s[0] == '+')
        a[p] ^= a[p + 1];
    else
        a[p] &= a[p + 1];
    mv(p + 1);
}

void inc(int x) {
    for (int i = 1; i < x; ++i)
        if ((a[i] | a[i + 1]) == 0) {
            cout << i << ' ' << '+' << endl;
            a[i] ^= a[i + 1];
            mv(i + 1);
            return;
        }
    // int len = 0;
    for (int i = 1; i < x; i++) {
        if (a[i] == 1)
            continue;
        int len_l = 0, len_r = 0;
        for (int j = i - 1; j >= 1; j--) {
            if (a[j] == 1)
                len_l++;
            else
                break;
        }
        for (int j = i + 1; j <= x; j++) {
            if (a[j] == 1)
                len_r++;
            else
                break;
        }
        if ((len_l + len_r) % 2) {
            cout << i << " +" << endl;
            a[i] ^= a[i + 1];
            mv(i + 1);
            return;
        }
    }
    if (a[x] == 0 && a[x - 1] == 1) {
        cout << x - 1 << ' ' << '+' << endl;
        a[x - 1] ^= a[x];
        mv(x);
        return;
    }
    for (int i = 1; i < x; ++i)
        if (a[i] != a[i + 1]) {
            cout << i << ' ' << '+' << endl;
            a[i] ^= a[i + 1];
            mv(i + 1);
            return;
        }
    cout << "1 *" << endl;
    a[1] &= a[2];
    mv(2);
}
void dec(int x) {
    for (int i = 1; i < x; ++i)
        if (a[i] & a[i + 1]) {
            cout << i << ' ' << '+' << endl;
            a[i] ^= a[i + 1];
            mv(i + 1);
            return;
        }
    for (int i = 1; i < x; ++i)
        if (a[i] != a[i + 1]) {
            cout << i << ' ' << '*' << endl;
            a[i] &= a[i + 1];
            mv(i + 1);
            return;
        }
    cout << "1 *" << endl;
    a[1] &= a[2];
    mv(2);
}
void workA(int d) {
    cout << "Alice" << endl;
    for (int i = 1; i < n; ++i)
        if (i % 2 == 1) {
            for (int j = n - i + 2; j <= n; ++j)
                a[j] = 0;
            if (d)
                inc(n - i + 1);
            else
                dec(n - i + 1);
        } else {
            moni();
        }
}
void workB(int d) {
    cout << "Bob" << endl;
    for (int i = 1; i < n; ++i)
        if (i % 2 == 0) {
            for (int j = n - i + 2; j <= n; ++j)
                a[j] = 0;
            if (d)
                inc(n - i + 1);
            else
                dec(n - i + 1);
        } else {
            moni();
        }
}

int main() {
    scanf("%d%d", &n, &t);
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        // a[i]%=2;
    }
    int p = f(n);
    if (n % 2 == 0) {
        if (t == 0) {
            workA(0);
        } else {
            if (p >= 0)
                workA(1);
            else
                workB(0);
        }
    } else {
        if (t == 0) {
            if (p > 0)
                workB(1);
            else
                workA(0);
        } else
            workB(0);
    }
    return 0;
}