Problem Statement

You are given three strings S_1, S_2, S_3S1,S2,S3 consisting of lowercase English letters, and a string $T$ consisting of 1, 2, 3.
Concatenate the three strings according to the characters in $T$ and print the resulting string. Formally, conform to the following instructions.

• For each integer $i$ such that $1\le i\le |T|$, let the string s_isi be defined as follows:
  • S_1S1, if the $i$-th character of $T$ is 1;
  • S_2S2, if the $i$-th character of $T$ is 2;
  • S_3S3, if the $i$-th character of $T$ is 3.
• Concatenate the strings s_1, s_2, \dots, s_{|T|}s1,s2,…,s∣T∣ in this order and print the resulting string.

Constraints

• 1 \leq |S_1|, |S_2|, |S_3| \leq 101≤∣S1∣,∣S2∣,∣S3∣≤10
• $1\le |T|\le 1000$
• S_1S1, S_2S2, and S_3S3 consist of lowercase English letters.
• $T$ consists of 1, 2, and 3.

S_1S1S_2S2S_3S3$T$