#include <bits/stdc++.h>
using namespace std;
const int maxn=10005;
int n,a[maxn];
char s[40],t[40];
int tot;
const int lef=86968;
int findnext(int pos,int x)
{
	for(int i=pos;i<=10000;i++)
		if((a[i]+lef)%27==x)
			return i;
}
vector<int> out;

void send()
{
	scanf("%s",s+1);
	int len=strlen(s+1);
	for(int i=1;i<=10000;i++)
		scanf("%d",&a[i]);
	for(int i=1;i<=len;i++)
	{
		if(s[i]!=s[i-1]||t[tot]=='#')t[++tot]=s[i];
		else t[++tot]='#';
	}
	int now=1;
	const int B=20;
	for(int i=1;i<=tot;i++)
	{
		int co=t[i]=='#'?26:t[i]-'a';
		for(int j=1;j<=B;j++)
		{
			//printf("!%d\n",now);
			//printf("%d\n",co);
			now=findnext(now,co);
			//printf("%d\n",now);
			out.push_back(a[now]);
			now++;
		}
	}
	//puts("Eva");
	printf("%d\n",out.size());
	for(int v:out)printf("%d ",v);
	putchar('\n');
}
void rece()
{
	scanf("%d\n",&n);
	int lst=26; 
	int llst=0;
	for(int i=1;i<=n;i++)
	{ 
		scanf("%d",&a[i]);
		a[i]+=lef;
		int x=a[i]%27;
		if(lst!=x)
		{
			if(x!=26)putchar(x+'a'),llst=x;
			else putchar(llst+'a');
		}
		lst=x;
	}
	putchar('\n');
}
string ss;
int main()
{
//	freopen("data.in","r",stdin);
//	freopen("Alisa.out","w",stdout);
//	freopen("Alisa.out","r",stdin);
//	freopen("Eva.out","w",stdout);
	cin>>ss;
	if(ss[0]=='A')
	{
		
		send();
	}
	else
	{
		
		//freopen("Alisa.out","r",stdin);
		//freopen("Eva.out","w",stdout);
		//puts("!");
	  	rece();
	}	
}