#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

string conv_p2(ll x){
    string ret = "";
    while (x > 0){
        if (x % 2 == 0){
            ret += '0';
        }
        else{
            ret += '1';
        }
        x /= 2;
    }
    reverse(all(ret));
    return ret;
}

int main() {
    string player;
    cin >> player;
    ll N, Q;
    cin >> N >> Q;

    if (player == "Alice"){
        vector<ll> A(N);
        rep(i, N){
            cin >> A[i];
        }
        // 最後だけは先頭の 1 を抜く（1 の場合はそもそも追加されない）
        // 1 が 1 個の場合だけ特別な取り決めをしてしまう
        if (N == 1 && A[0] == 1){
            cout << 1 << endl;
            for (ll i = 0; i < 31; i++){
                cout << "1";
            }
            cout << endl;
            return 0;
        }
        vector<ll> diffs(N);
        diffs[0] = A[0];
        for (ll i = 1; i < N; i++){
            diffs[i] = A[i] - A[i - 1];
        }
        vector<string> sr;
        for (ll i = 0; i < N; i++){
            sr.push_back(conv_p2(diffs[i]));
        }
        if (sr[N - 1] == "1"){
            sr.pop_back();
        }
        else{
            string sr_new = "";
            for (ll i = 1; i < sr[N - 1].size(); i++) sr_new += sr[N - 1][i];
            sr[N - 1] = sr_new;
        }
        ll K = sr.size();
        cout << K << endl;
        for (ll i = 0; i < K; i++){
            cout << sr[i] << endl;
        }
    }
    else{
        ll K;
        cin >> K;
        vector<string> sr(K);
        rep(i, K) cin >> sr[i];

        if (K == 1 && sr[0].size() > 30){
            cout << 1 << endl;
            return 0;
        }
        
        vector<ll> ans;
        ll now = 0;
        for (ll i = 0; i < N - 1; i++){
            ll len = sr[i].size();
            for (ll j = len - 1; j >= 0; j--){
                if (sr[i][j] == '1') now += (1LL << (len - 1 - j));
            }
            ans.push_back(now);
        }
        if (K < N) ans.push_back(now + 1);
        else{
            ll len = sr[N - 1].size();
            for (ll j = len - 1; j >= 0; j--){
                if (sr[N - 1][j] == '1') now += (1LL << (len - 1 - j));
            }
            now += (1LL << len);
            ans.push_back(now);
        }
        for (ll i = 0; i < N; i++){
            cout << ans[i];
            if (i < N - 1) cout << " ";
        }
        cout << endl;
    }
}