#include <bits/stdc++.h>
using namespace std;
int gi() {
	int res = 0, w = 1;
	char ch = getchar();
	while (ch != '-' && !isdigit(ch)) ch = getchar();
	if (ch == '-') w = -1, ch = getchar();
	while (isdigit(ch)) res = res * 10 + ch - '0', ch = getchar();
	return res * w;
}
#define fi first
#define se second
#define pii pair<int, int>
using LL = long long;
using db = long double;
const LL INF = 1e18;
const int Mod = 998244353;
const int MAX_N = 5005;
int N, M, a[MAX_N];
void solve() {
	N = gi(), M = gi();
	for (int i = 1; i <= N; i++) a[i] = gi();
	sort(a + 1, a + N + 1);
	int pos = 0;
	for (int i = N; i >= 1; i--)
		if (M / a[i] < N - i) { pos = a[i]; break; }
	if (pos == 0) {
		cout << "Alessia" << endl;
		set<pii> S; S.emplace(M, 1);
		for (int i = N; i >= 1; i--) {
			auto p = *S.rbegin(); S.erase(p);
			cout << a[i] << " " << p.se << endl;
			int y = gi(); S.emplace(y - p.se, p.se);
			int t = p.fi - (y - p.se) - 1;
			if (t > 0) S.emplace(t, y + 1);
		}
	} else {
		cout << "Bernardo" << endl;
		for (int i = 1; i <= N; i++) {
			int y = gi(), a = gi();
			if (y >= pos) cout << (a + pos - 1) / pos * pos << endl;
			else cout << a << endl;
		}
	}
}
int main () {
#ifndef ONLINE_JUDGE
    freopen("cpp.in", "r", stdin);
	//freopen("cpp.out", "w", stdout);
#endif
	int T = 1; //T = gi();
	while (T--) {
		solve();
	}
    return 0;
}