#include <bits/stdc++.h>
using namespace std;

using ll = long long;
//#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

const int DIV=1e9/27;

int find(int x)
{
    while(true)
    {
        int y;
        cin>>y;
        if(y/DIV==x)
            return y;
    }
}

void alisa()
{
    string word;
    cin>>word;
    int n;
    cin>>n;
    vector<int> v;
    int prv=-1;
    for(char c:word) {
        int cur=c-'a';
        if(cur==prv)
            v.push_back(26);
        v.push_back(cur);
        prv=cur;
    }
    int times=n/v.size()/40;
    cout<<v.size()*times<<"\n";
    for(int x:v)
        for(int i=0;i<times;i++)
            cout<<find(x)<<" ";
}

void eva()
{
    int k;
    cin>>k;
    vector<int> v;
    while(k--)
    {
        int cur;
        cin>>cur;
        cur/=DIV;
        if(v.empty()||v.back()!=cur)
            v.push_back(cur);
    }
    for(int x:v)
        if(x!=26)
            cout<<char('a'+x);
}

signed main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

    string name;
    cin>>name;
    if(name=="Alisa")
        alisa();
    else
        eva();
}