#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;

typedef __int128_t lll;

namespace task1
{
    int n;
    char str[21];

    lll qwq;

    void main()
    {
        cin >> str;
        for (int i = 0; i < 15; i++)
            qwq = qwq * 27 + (str[i] == 0 ? 0 : str[i] - 'a' + 1);
        vector<int> a;
        cin >> n;
        for (int i = 0; i < n; i++)
        {
            int x;
            cin >> x;
            if (qwq >> (x % 72) & 1)
                a.push_back(x);
        }
        cout << a.size() << endl;
        for (int x : a)
            cout << x << " ";
        cout << endl;
    }
}

namespace task2
{
    lll qwq;
    char str[20];
    void main()
    {
        int n;
        cin >> n;
        for (int i = 0; i < n; i++)
        {
            int x;
            cin >> x;
            qwq |= lll(1) << (x % 72);
        }
        for (int i = 14; i >= 0; i--)
        {
            int x = qwq % 27;
            qwq /= 27;
            str[i] = x == 0 ? 0 : 'a' + x - 1;
        }
        cout << str << endl;
    }
}

char s[100];

int main()
{
    cin >> s;
    if (s[0] == 'A')
        task1::main();
    else
        task2::main();
}