#include<bits/stdc++.h>
using namespace std;
char a[110],b[110],c[110];
char x[510]={},y[510]={};
int o;
int main(){
	cin>>a>>b>>c;
	memset(x,'0',sizeof(x));
	memset(y,'0',sizeof(y));
	for (int i=0;i<strlen(a);i++){
		/*if (x[a[i]]!='0'){
			cout<<"Failed";
			return 0;
		}
		else*/{
			x[a[i]]=b[i];
		}
		/*if (y[b[i]]!='0'){
			cout<<"Failed";
			return 0;
		}
		else*/{
			y[b[i]]=a[i];
		}
	}
	for (int i='A';i<='Z';i++){
		if (x[i]=='0'||y[i]=='0'){
			cout<<"Failed";
			return 0;
		}
	}
	for (int i=0;i<strlen(c);i++){
		cout<<x[c[i]];
	}
	return 0;
}

求如何用桶的思想判第一个Failed