There are two popular keyboard layouts in Berland, they differ only in letters positions. All the other keys are the same. In Berland they use alphabet with 26 letters which coincides with English alphabet.
You are given two strings consisting of 26 distinct letters each: all keys of the first and the second layouts in the same order.
You are also given some text consisting of small and capital English letters and digits. It is known that it was typed in the first layout, but the writer intended to type it in the second layout. Print the text if the same keys were pressed in the second layout.
Since all keys but letters are the same in both layouts, the capitalization of the letters should remain the same, as well as all other characters.
## Input
The first line contains a string of length 26 consisting of distinct lowercase English letters. This is the first layout.
The second line contains a string of length 26 consisting of distinct lowercase English letters. This is the second layout.
The third line contains a non-empty string _s_ consisting of lowercase and uppercase English letters and digits. This is the text typed in the first layout. The length of _s_ does not exceed 1000.
## Output
Print the text if the same keys were pressed in the second layout.
[samples]
在 Berland，有两种流行的键盘布局，它们仅在字母的位置上不同，其他所有键都相同。Berland 使用包含 #cf_span[26] 个字母的字母表，与英语字母表一致。
你将得到两个字符串，每个字符串包含 #cf_span[26] 个互不相同的字母，分别表示第一种和第二种布局中所有键的顺序。
你还得到一段由小写和大写英文字母及数字组成的文本。已知这段文本是使用第一种布局输入的，但输入者本意是使用第二种布局输入。请输出如果在第二种布局中按下了相同的键，所得到的文本。
由于除了字母外，其他所有键在两种布局中都相同，因此字母的大小写应保持不变，其他所有字符也应保持不变。
第一行包含一个长度为 #cf_span[26] 的字符串，由互不相同的英文小写字母组成，表示第一种布局。
第二行包含一个长度为 #cf_span[26] 的字符串，由互不相同的英文小写字母组成，表示第二种布局。
第三行包含一个非空字符串 #cf_span[s]，由英文小写和大写字母及数字组成，表示使用第一种布局输入的文本。字符串 #cf_span[s] 的长度不超过 #cf_span[1000]。
请输出如果在第二种布局中按下了相同的键，所得到的文本。
## Input
第一行包含一个长度为 #cf_span[26] 的字符串，由互不相同的英文小写字母组成，表示第一种布局。第二行包含一个长度为 #cf_span[26] 的字符串，由互不相同的英文小写字母组成，表示第二种布局。第三行包含一个非空字符串 #cf_span[s]，由英文小写和大写字母及数字组成，表示使用第一种布局输入的文本。字符串 #cf_span[s] 的长度不超过 #cf_span[1000]。
## Output
请输出如果在第二种布局中按下了相同的键，所得到的文本。
[samples]
**Definitions**
Let $ L_1 = (l_{1,1}, l_{1,2}, \dots, l_{1,26}) $ be the first keyboard layout, a permutation of the 26 lowercase English letters.
Let $ L_2 = (l_{2,1}, l_{2,2}, \dots, l_{2,26}) $ be the second keyboard layout, a permutation of the 26 lowercase English letters.
Let $ s = s_1 s_2 \dots s_m $ be the input string of length $ m \leq 1000 $, consisting of uppercase/lowercase English letters and digits.
**Constraints**
1. $ L_1 $ and $ L_2 $ are bijections from $ \{1, \dots, 26\} $ to the set of lowercase English letters.
2. For all $ i \in \{1, \dots, 26\} $, $ l_{1,i} \ne l_{1,j} $ and $ l_{2,i} \ne l_{2,j} $ for $ i \ne j $.
3. Each character in $ s $ is either a digit ('0'–'9'), a lowercase English letter ('a'–'z'), or an uppercase English letter ('A'–'Z').
**Objective**
Construct the output string $ s' = s'_1 s'_2 \dots s'_m $, where for each character $ s_i $:
- If $ s_i $ is a digit, then $ s'_i = s_i $.
- If $ s_i $ is a lowercase letter, let $ j $ be the index such that $ l_{1,j} = s_i $; then $ s'_i = l_{2,j} $.
- If $ s_i $ is an uppercase letter, let $ j $ be the index such that $ l_{1,j} = \text{lower}(s_i) $; then $ s'_i = \text{upper}(l_{2,j}) $.
That is, map each letter in $ s $ from its position in $ L_1 $ to the corresponding position in $ L_2 $, preserving case.