#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    string S;
    ll N,Q;cin>>S>>N>>Q;
    if(S=="Alice"){
        vl A(N);
        for(int i=0;i<N;i++){
            cin>>A[i];
        }
        ll la=0;
        cout<<N<<endl;
        for(int i=0;i<N;i++){
            ll diff=A[i]-la+1;
            string T;
            for(int q=0;q<30;q++){
                if(diff&(1LL<<q)) T+='1';
                else T+='0';
            }
            while(T.back()=='0') T.pop_back();
            T.pop_back();
            reverse(all(T));
            cout<<T<<endl;
            la=A[i];
        }
    }else{
        cin>>N;
        vl ans(N);
        ll la=0;
        for(int i=0;i<N;i++){
            string Z;cin>>Z;
            reverse(all(Z));
            Z+='1';
            ll diff=0;
            for(int j=0;j<si(Z);j++){
                if(Z[j]=='1') diff|=(1LL<<j);
            }
            diff--;
            la+=diff;
            ans[i]=la;
        }
        for(int i=0;i<N;i++){
            cout<<ans[i]<<" ";
        }
        cout<<endl;
    }
}