#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
// #define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector
// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;
int iter=1,itera=1;
void solve(){
int l;
cin>>l;
int q;
cin>>q;
for(int q1=0;q1<q;q1++){
string s;
cin>>s;
if(s[0]=='a'){
int a;
cin>>a;
vec<int>ans;
for(int i=0;i<10;i++){
if(a&1){
int x=(i+1)*2;
for(int j=0;j<x;j++) ans.append(x);
}
a>>=1;
}
// cout<<"a ";
cout<<ans.size()<<' ';
print(ans)
}
elif(s[0]=='b'){
int a;
cin>>a;
vec<int>ans;
for(int i=0;i<10;i++){
if(a&1){
int x=(i+1)*2+1;
for(int j=0;j<x;j++) ans.append(x);
}
a>>=1;
}
// cout<<"b ";
cout<<ans.size()<<' ';
print(ans)
}
else{
int n;
cin>>n;
vec<int>c(n);
inp(c);
int a=0,b=0;
for(auto i:c){
int g=i/2-1;
g=1<<g;
if(i%2) b+=g;
else a+=g;
}
if(a>b) cout<<"A"<<endl;
else cout<<"B"<<endl;
}
}
}
signed main(){
// freopen("","r",stdin);
// freopen("","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<fixed<<setprecision(20);
// cin>>itera;
for(iter=1;iter<=itera;iter++) solve();
}
