#include <bits/stdc++.h>

const int N = 105;
const int M = 5005;

int n, m, a[N], vis[M];

int main() {
    std::ios::sync_with_stdio(false);
    std::cin >> n >> m;
    for (int i = 1; i <= n; ++i) std::cin >> a[i];
    std::sort(a + 1, a + 1 + n, std::greater<int>());
    bool flg = 0;
    for (int i = 1; i <= n; ++i)
        if (a[i] > m / i) { flg = 1; break; }
    if (flg) { // B
        std::cout << "Bernardo" << std::endl;
        for (int i = 1; i <= n; ++i) {
            int y, x; std::cin >> y >> x;
            int fd = -1;
            for (int j = x; j <= x + y - 1; ++j)
                if (vis[j]) { fd = j; break; }
            if (fd != -1) std::cout << fd << std::endl;
            else {
                int pos = ((x + y - 1) / y) * y;
                if (pos <= x + y - 1) vis[pos] = 1, std::cout << pos << std::endl;
                else vis[x] = 1, std::cout << x << std::endl;
            }
        }
    } else { // A
        std::cout << "Alessia" << std::endl;
        std::set<int> vis;
        vis.insert(m + 1);
        for (int i = 1; i <= n; ++i) {
            int lst = 0, res = -1;
            for (int x : vis) {
                if (x - lst - 1 >= a[i]) {
                    res = lst + 1;
                    break;
                }
                lst = x;
            }
            std::cout << a[i] << ' ' << res << std::endl;
            int x; std::cin >> x;
            vis.insert(x);
        }
    }
    return 0;
}