#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#define MAXX 101
using namespace std;
int p1;//字符大小写
int p2;//重复次数
int p3;//1正序，2逆序
int len1,len2,len3;//原串长，拓展后串长
char s[MAXX];
char ans[MAXX*MAXX];
char pre[MAXX*MAXX];
bool vis[MAXX];
bool in[MAXX];
void init(){
  scanf("%d%d%d",&p1,&p2,&p3);
  cin>>(s+1);
  len1=strlen(s+1);
}
bool check(int i){
  if(s[i]>s[i+2])return 0;
  if(s[i]>='0'&&s[i]<='9' && s[i+2]>='0'&&s[i+2]<='9')return 1;
  if(s[i]>='a'&&s[i]<='z' && s[i+2]>='a'&&s[i+2]<='z')return 1;
  if(s[i]>='A'&&s[i]<='Z' && s[i+2]>='A'&&s[i+2]<='Z')return 1;
  return 0;
}
void work(int k){
  if(s[k]==s[k+2]){ans[++len2]=s[k];ans[++len2]=s[k+1];vis[k]=vis[k+1]=true;return;}
  if(s[k]+1==s[k+2]){
    ans[++len2]=s[k];
    vis[k]=vis[k+1]=true;
    return;
  }
  if(!in[k]){ans[++len2]=s[k];in[k]=true;}
  len3=0;//清空原串长
  if(p1==1){
    if(s[k]>='A'&&s[k]<='Z'){
      for(int i=s[k]+1;i<s[k+2];++i){
	for(int j=1;j<=p2;++j)pre[++len3]=i-'A'+'a';
      }
    }
    else
    for(int i=s[k]+1;i<s[k+2];++i)
    for(int j=1;j<=p2;++j)pre[++len3]=i;  
  }
  if(p1==2){
     if(s[k]>='a'&&s[k]<='z')
      for(int i=s[k]+1;i<s[k+2];++i)
	for(int j=1;j<=p2;++j)pre[++len3]=i-'a'+'A';
    else
      for(int i=s[k]+1;i<s[k+2];++i)
	for(int j=1;j<=p2;++j)pre[++len3]=i;
  }
  if(p1==3){
    for(int i=s[k]+1;i<s[k+2];++i)
      for(int j=1;j<=p2;++j)ans[++len2]='*';
    vis[k]=vis[k+1]=true;
    return;
  }
  if(p3==1)for(int i=1;i<=len3;++i)ans[++len2]=pre[i];
  else for(int i=len3;i;--i)ans[++len2]=pre[i];
  vis[k]=vis[k+1]=true;
}
void findanswer(){
  for(int i=1;i<=len1;++i)if(!vis[i]){
      if(s[i+1]=='-'){
	if(check(i))work(i);
	else ans[++len2]=s[i],ans[++len2]=s[i+1],i=i+1;
	continue;
      }
      else ans[++len2]=s[i];
  }
  for(int i=1;i<=len2;++i)cout<<ans[i];
  return;
}
int main(){
  freopen("expand.in","r",stdin);
  freopen("expand.out","w",stdout);
  init();
  findanswer();
  return 0;
}