#include <iostream>
using namespace std;

const int N = 10;
int p[N];
string ch;

void quick_sort(int p[], int l, int r)
{
	if(l >= r) return ;
	
	int i = l - 1, j = r + 1, mid = p[l + r >> 1];
	while(i < j)
	{
		do i++; while(p[i] < mid);
		do j--; while(p[j] > mid);
		if(p[i] < p[j]) swap(p[i], p[j]);
	}
	quick_sort(p, l, mid);
	quick_sort(p, mid + 1, r);
}

int main()
{
	int n = 3;
	for(int i = 0; i < n; i++) cin >> p[i];
	puts("");
	quick_sort(p, 0, n - 1);
	cin >> ch;
	if(ch == "ABC") cout << p[0] << p[1] << p[2];
	else if(ch == "ACB") cout << p[0] << p[2] << p[1];
	else if(ch == "BCA") cout << p[1] << p[2] << p[0];
	else if(ch == "BAC") cout << p[1] << p[0] << p[2];
	else if(ch == "CAB") cout << p[2] << p[0] << p[1];
	else if(ch == "CBA") cout << p[2] << p[1] << p[0];
	return 0;
}