// #include <bits/stdc++.h> #include <iostream> #include <cmath> #include <algorithm> #include <map> #include <vector> #include <iomanip> #include <string> #include <queue> #include <set> #include <deque> #include <numeric> #include <stack> #include <chrono> using namespace std; void fast_io(){ // freopen("", "r", stdin); // freopen("", "w", stdout); ios::sync_with_stdio(0); cin.tie(); cout.tie(); cout << setprecision(9); } #define int long long // #define endl '\n' #define all(v) (v).begin(), (v).end() #define rall(v) (v).rbegin(), (v).rend() #define fi first #define se second void solve() { int L; cin >> L; int Q; cin >> Q; for (int q = 1; q <= Q; q++){ string s; cin >> s; if (s[0] == 'a'){ int A; cin >> A; cout << A << ' '; for (int i = 1; i <= A; i++) cout << 1 << endl; } else if (s[0] == 'b'){ int B; cin >> B; cout << B << ' '; for (int i = 1; i <= B + 100; i++) cout << 2 << endl; } else { int n; cin >> n; int A, B; cin >> A >> B; if (A > B) swap(A, B); B -= 100; if (B > A) cout << "B" << endl; else cout << "A" << endl; } } return; } signed main() { fast_io(); srand(chrono::steady_clock::now().time_since_epoch().count()); int tc = 1; // cin >> tc; while (tc--) solve(); return 0; }