#include <bits/stdc++.h>

#define rep(i, s, n) for (int i = int(s); i < int(n); i++)
#define rrep(i, s, n) for (int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ull = unsigned long long;
using ld = long double;

template <class T> bool chmin(T &a, T b) {
    if (a <= b) return false;
    a = b;
    return true;
}

template <class T> bool chmax(T &a, T b) {
    if (a >= b) return false;
    a = b;
    return true;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::string name;
    std::cin >> name;
    const int sz = 26;
    if(name == "Alisa") {
        std::string s;
        std::cin >> s;
        int len = s.size();
        int n;
        std::cin >> n;
        assert(n == 10000);
        std::vector<int> a(n);
        std::vector<int> p = {s[0] - 'a'};
        rep(i,1,len) {
            if(s[i] == s[i-1]) p.emplace_back(sz);
            p.emplace_back(s[i] - 'a');
        }
        int m = p.size();
        std::vector<int> b;
        rep(i,0,n) {
            std::cin >> a[i];
            int idx = i / (n / m);
            if(idx < m && a[i] % (sz + 1) == p[idx]) {
                b.emplace_back(a[i]);
            }
        }
        std::cout << b.size() << '\n';
        rep(i,0,b.size()) {
            std::cout << b[i] << " \n"[i + 1 == (int)b.size()];
        }
    }
    else {
        assert(name == "Eva");
        int m;
        std::cin >> m;
        std::string ans = "";
        int prev = -1;
        rep(i,0,m) {
            int x;
            std::cin >> x;
            int p = x % (sz + 1);
            if(prev != p) {
                if(p < sz) ans += char('a' + p);
            }
            prev = p;
        }
        std::cout << ans << '\n';
    }
}