#include <bits/stdc++.h>

using namespace std;

typedef long double ldb;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned int u32;
typedef pair<int, int> pii;

std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
// priority_queue<int, vector<int>, greater<int>> minq;
// ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// fflush(stdout);

const int inf = 1000000007;
const i64 prm = 998244353;
const i64 inf2 = ((i64)inf) * inf;
const int maxn = 1100010; // 1.1e6

inline int read(){
  int x=0,f=0; char ch=getchar();
  while(!isdigit(ch)) f|=(ch==45),ch=getchar();
  while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
  return f?-x:x;
}

const int B = 12;
const int L = 27;

const int b = 13;
const int d = 6;

auto getc(vector<int>& a, int c) {
  vector<int> vt;
  while (a.size()) {
    if (a.back() % L == c) {
      vt.push_back(a.back());
    }
    a.pop_back();
    if (vt.size() == B) {
      break;
    }
  }
  return vt;
}
int main() {
  string s;
  cin >> s;
  if (s[0] == 'A') {
    cin >> s;
    int n = read();
    vector<int> a(n);
    for (int i = 0; i < n; ++i) a[i] = read();
    vector<int> res;
    while (s.size()) {
      auto vt = getc(a, s.back()-'a');
      s.pop_back();
      res.insert(res.end(), vt.begin(), vt.end());
      if (s.size()) {
        vt = getc(a, 26);
        res.insert(res.end(), vt.begin(), vt.end());
      }
    }
    reverse(res.begin(), res.end());

    cout << res.size() << endl;
    for (auto e: res) {
      printf("%d ", e);
    }
    puts("");

    /*
    puts("Eva");
    vector<int> ans;
    for (auto e: res) if (rng() & 1) {
      ans.push_back(e);
    }
    cout <<ans.size() << endl;
    for (auto e: ans) {
      printf("%d ", e);
    }
    puts("");
    */
  } else {
    int n = read();
    vector<int> a(n);
    for (int i = 0; i <n; ++i) a[i] = read();
    for (int i = 0; i < n; ++i) {
      int j = i;
      while (j < n && a[i] % L == a[j] % L) {
        j++;
      }
      if (a[i] % L == 26) continue;
      putchar((a[i] % L) + 'a');
      /*
      int len = j-i;
      int k = (len + d) / b;
      char c = (a[i] % 26) + 'a';
      while (k--) putchar(c);
      */
      i = j-1;
    }
    puts("");
  }
  return 0;
}