#include <bits/stdc++.h>

const int N = 5005;

int n, m, a[N];

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>());
    int flg = 0;
    for (int i = 1; i <= n; ++i)
        if (a[i] > m / i) { flg = i; break; }
    std::set<int> used;
    used.insert(m + 1);
    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;
            auto fy = used.lower_bound(y), fx = used.lower_bound(x);
            if (fy != fx || *fy == y)
                std::cout << *fx << std::endl;
            else {
                int pos = ((x + a[flg] - 1) / a[flg]) * a[flg];
                if (pos <= x + y - 1) used.insert(pos), std::cout << pos << std::endl;
                else used.insert(x), std::cout << x << std::endl;
            }
        }
    } else { // A
        std::cout << "Alessia" << std::endl;
        for (int i = 1; i <= n; ++i) {
            int lst = 0, res = -1;
            for (int x : used) {
                if (x - lst - 1 >= a[i]) {
                    res = lst + 1;
                    break;
                }
                lst = x;
            }
            std::cout << a[i] << ' ' << res << std::endl;
            int x; std::cin >> x;
            used.insert(x);
        }
    }
    return 0;
}