#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<set>
#include<map>
#include<stack>
#define Max(a,b) (((a)>(b))?(a):(b))
#define Min(a,b) (((a)<(b))?(a):(b))
#define L(i,j,k) for(int i=(j);i<=(k);i++)
#define R(i,j,k) for(int i=(j);i>=(k);i--)
using namespace std;
int a[4];
char A,B,C;
int main() {
	L(i,1,3)scanf("%d",&a[i]);
	sort(a+1,a+3+1);
	int x=getchar();
	scanf("%c%c%c",&A,&B,&C);
	printf("%d %d %d",a[A-'A'+1],a[B-'A'+1],a[C-'A'+1]);
	return 0;
}

测试点1是

1 2 3
ABC

答案是

1 2 3

蒟蒻不懂