{"raw_statement":[{"iden":"statement","content":"You are given an encrypted string, encrypted using a certain algorithm. Decrypt it !\n\n\n\nThe first line of input contains 26 integers a1, ..., a26 separated by space (1 ≤ ai ≤ 105).\n\nNext  lines, each line contains an integer between 1 and 105 inclusive.\n\nPrint a single string in a single line.\n\n"},{"iden":"input","content":"The first line of input contains 26 integers a1, ..., a26 separated by space (1 ≤ ai ≤ 105).Next  lines, each line contains an integer between 1 and 105 inclusive."},{"iden":"output","content":"Print a single string in a single line."},{"iden":"examples","content":"Input1 0 1 0 1 0 0 2 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 13162745OutputcharzehInput0 0 0 0 1 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 1 05672431OutputyousefiInput0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 1 0 0 0 0 0 0123Outputmmt"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ A = (a_1, a_2, \\dots, a_{26}) \\in \\mathbb{Z}^{26} $ be a sequence of integers where $ 1 \\leq a_i \\leq 10^5 $ for all $ i \\in \\{1, \\dots, 26\\} $.  \nLet $ B = (b_1, b_2, \\dots, b_m) \\in \\mathbb{Z}^m $ be a sequence of integers where each $ b_j \\in [1, 10^5] $, and $ m $ is the number of subsequent input lines.\n\n**Constraints**  \n1. $ 1 \\leq a_i \\leq 10^5 $ for all $ i \\in \\{1, \\dots, 26\\} $  \n2. $ 1 \\leq b_j \\leq 10^5 $ for all $ j \\in \\{1, \\dots, m\\} $\n\n**Objective**  \nDecrypt the sequence $ B $ into a string $ S $ of length $ m $, where each $ b_j $ maps to the $ a_i $-th letter of the alphabet (i.e., the letter corresponding to the $ i $-th smallest value in $ A $). Specifically:  \n- Sort $ A $ to obtain the sorted sequence $ A' = (a_{(1)}, a_{(2)}, \\dots, a_{(26)}) $, where $ a_{(1)} < a_{(2)} < \\dots < a_{(26)} $.  \n- Let $ \\sigma $ be the permutation such that $ a_{\\sigma(i)} = a_{(i)} $.  \n- For each $ b_j $, find the unique $ i \\in \\{1, \\dots, 26\\} $ such that $ b_j = a_{\\sigma(i)} $, and output the $ i $-th letter of the English alphabet (i.e., 'a' for $ i=1 $, 'b' for $ i=2 $, ..., 'z' for $ i=26 $).  \n\nOutput the resulting string $ S = s_1 s_2 \\dots s_m $, where $ s_j $ is the letter corresponding to $ b_j $ under the above mapping.","simple_statement":"You are given 26 numbers representing the frequency of letters a to z. Then, you are given a list of integers. Each integer is a position in the alphabet (1 to 26). Convert each integer to the corresponding letter (1=a, 2=b, ..., 26=z) and print the resulting string.","has_page_source":false}