Agent Encrypto has gone undercover into the enemy territory of CryptoLand to learn their battle plans. His handler Agent Decrypto has hacked their mail servers but he is unable to understand any of the information because it is encrypted in a very secret language called CryptoPerm. It is up to Agent Encrypto now to protect the Nation from the enemies. And he has to hurry because the enemies are starting to get suspicious.

Agent Encrypto has found out that CryptoPerm code works in the following ways:

CryptoPerm uses only lowercase alphabets
The alphabet set(original_set) is replaced by its encrypted form(encrypted_set) which is actually a permutation of the original_set.
Some of the alphabets encr_i are initially chosen and it is fixed that each of them will be replaced by an alphabet decr_i
Of all the possible permutations of the encrypted_set(given that some letters are fixed), the Kth lexicographically smallest such permutation is used.

You have been hired to solve this problem because of your coding skills. Your mission, should you choose to accept is given all encr_i, all decr_i and K, you need to find the encrypted form of the alphabet which is the CryptoPerm code. We hope you can save the day.

Input:

First line contains T which is the number of test cases.

Each test case contains 3 lines.

First line of every test case contains a string containing all the encr_i.
Second line of every test case contains a string containing all the decr_i.
Third line contains an integer K, indicating which permutation of all the possibilities is the CryptoPerm code of the alphabet.

Output:

For each test case, output a line containing the representation of the alphabet in CryptoPerm.
If the corresponding permutation does not exist, print "Not possible!"(without the quotes) instead.

Constraints:

1 ≤ T ≤ 10000

1 ≤ length of string containing all the encr_i = length of string containing all the decr_i ≤ 26

1 ≤ K ≤10¹⁸

Scoring:

1 ≤ T ≤ 10, 1 ≤ K ≤ 10 : (30 pts)

1 ≤ T ≤ 100, 1 ≤ K ≤ 1000 : (30 pts)

Original Constraints : (40 pts)