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

#define ll long long
#define elif else if
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int,int>


#define repname(a, b, c, d, e, ...) e
#define rep(...)                    repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define rep0(x)                     for (int rep_counter = 0; rep_counter < (x); ++rep_counter)
#define rep1(i, x)                  for (int i = 0; i < (x); ++i)
#define rep2(i, l, r)               for (int i = (l); i < (r); ++i)
#define rep3(i, l, r, c)            for (int i = (l); i < (r); i += (c))





struct ScalarInput {
    template<class T>
    operator T(){
        T ret;
        cin >> ret;
        return ret;
    }
};
struct VectorInput {
    size_t n;
    VectorInput(size_t n): n(n) {}
    template<class T>
    operator vector<T>(){
        vector<T> ret(n);
        for(T &x : ret) cin >> x;
        return ret;
    }
};
ScalarInput input(){ return ScalarInput(); }
VectorInput input(size_t n){ return VectorInput(n); }

template<typename T>
void print(vector<T> a){
  for(int i=0;i<a.size();i++){
    cout<<a[i]<<" \n"[i+1==a.size()];
  }
}

template<class T>
void print(T x){
    cout << x << '\n';
}
 
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail){
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}



vector<int> encode(string s, vector<int> a) {
    int n = 10000;
    int m = s.length();
    vector<int> size_inf;
    int R = n - 1;

    while (true) {
        if (a[R] % 16 == m) {
            size_inf.push_back(a[R]);
            if (size_inf.size() == 20) {
                break;
            }
        }
        R -= 1;
    }

    vector<int> a1(n), a2(n), a3(n), a4(n);
    for (int i = 0; i < n; ++i) {
        a1[i] = a[i] % 26;
        a2[i] = (a[i] / 100) % 26;
        a3[i] = (a[i] / 10000) % 26;
        a4[i] = (a[i] / 1000000) % 26;
    }

    int ng = R;
    int ok = 0;

    while (abs(ng - ok) > 1) {
        int mid = (ng + ok) / 2;
        int now = 0;
        int flag = 1;

        for (int i = 0; i < m; ++i) {
            int cnt = 0;

            while (cnt < mid && now < R) {
                if (a1[now] == s[i] - 'a' || a2[now] == s[i] - 'a' || a3[now] == s[i] - 'a' || a4[now] == s[i] - 'a') {
                    cnt += 1;
                }
                now += 1;
            }

            if (cnt != mid) {
                flag = 0;
            }
        }

        if (flag) {
            ok = mid;
        } else {
            ng = mid;
        }
    }

    vector<int> ans;
    int now = 0;

    for (int i = 0; i < m; ++i) {
        int cnt = 0;

        while (cnt < ok && now < R) {
            if (a1[now] == s[i] - 'a' || a2[now] == s[i] - 'a' || a3[now] == s[i] - 'a' || a4[now] == s[i] - 'a') {
                cnt += 1;
                ans.push_back(a[now]);
            }
            now += 1;
        }
    }

    ans.insert(ans.end(), size_inf.rbegin(), size_inf.rend());
    return ans;
}

string decode(vector<int> a) {
    int size = a.back() % 16;

    while (a.back() % 16 == size) {
        a.pop_back();
    }

    int n = a.size();
    vector<int> a2(n), a3(n), a4(n), a1(n);

    for (int i = 0; i < n; ++i) {
        a1[i] = a[i] % 26;
        a2[i] = (a[i] / 100) % 26;
        a3[i] = (a[i] / 10000) % 26;
        a4[i] = (a[i] / 1000000) % 26;
    }

    int t = (n + size / 2) / size;
    vector<char> ans;
    int now = 0;

    while (now < n) {
        int mx = -1;
        int res = -1;

        for (int i = 0; i < 26; ++i) {
            int cnt = 0;

            while (now + cnt < n) {
                if (a1[now + cnt] == i || a2[now + cnt] == i || a3[now + cnt] == i || a4[now + cnt] == i) {
                    cnt += 1;
                } else {
                    break;
                }
            }

            if (mx < cnt) {
                mx = cnt;
                res = i;
            }
        }

        for (int i = 0; i < max(1, mx + t / 2) / t; ++i) {
            ans.push_back('a' + res);
        }

        now += mx;
    }

    return string(ans.begin(), ans.end());
}


int main(){
  //ios::sync_with_stdio(false);
  //cin.tie(nullptr);
  string T;
  cin>>T;
  if(T[0]=='A'){
    string s;
    cin>>s;
    int n;
    cin>>n;
    vector<int>A(n);
    rep(i,n)cin>>A[i];
    vector<int>ans=encode(s,A);
    print(ans.size());
    print(ans);
  }
  else{
    int m;
    cin>>m;
    vector<int>B(m);
    rep(i,m)cin>>B[i];
    print(decode(B));
  }
}