#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1LL)
#define MASK(i) (1LL << (i))
const ll BLOCK = 1e7;
int main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
    string task;
    cin>>task;
    if (task=="Alisa"){
        ll n;
        string s;
        cin>>s;
        cin>>n;
        vector <ll> a(n);
        for (auto &x:a)cin>>x;
        vector <ll> id[110];
        vector <ll> ans;
        for (ll i = 0;i < n;i++){
            id[a[i]/BLOCK].push_back(i);
        }
        ll ptr = 0;
        auto add = [&](bool x){
            if (x==1)ans.push_back(ptr);
            ptr++;
        };
        for (ll i=0;i<4;i++)add(BIT(sz(s),i));
        for (auto tmp:s){
            ll x = tmp - 'a';
            for (ll i = 0;i < 5;i ++)add(BIT(x,i));
        }
        vector <ll> res;
        for (auto x:ans){
            for (auto y:id[x])res.push_back(y);
        }
        sort(res.begin(),res.end());
        cout<<sz(res)<<'\n';
        for (auto x:res){
            cout<<a[x]<<' ';
        }
        cout<<'\n';
    }
    else{
        ll n;
        cin>>n;
        vector <ll> a(n);
        for (auto &x:a)cin>>x;
        vector <bool> mask(110);
        for (auto x:a){
            mask[x/BLOCK]=1;
        }
        ll sz = 0;
        for (ll i = 0;i < 4;i ++)sz += MASK(i) * mask[i];
        ll ptr = 4;
        for (ll i = 0;i < sz;i ++,ptr+=5){
            ll x = 0;
            for (ll j = 0;j < 5;j ++){
                x += MASK(j) * mask[ptr+j];
            }
            cout<<char(x+'a');
        }
        cout<<'\n';
    }
    return 0;
}