CIPHERJ  Cipher
Bob and Alice started to use a brandnew encoding scheme. Surprisingly it is not a Public Key Cryptosystem, but their encoding and decoding is based on secret keys. They chose the secret key at their last meeting in Philadelphia on February 16th, 1996. They chose as a secret key a sequence of n distinct integers, , greater than zero and less or equal to n. The encoding is based on the following principle. The message is written down below the key, so that characters in the message and numbers in the key are correspondingly aligned. Character in the message at the position i is written in the encoded message at the position , where is the corresponding number in the key. And then the encoded message is encoded in the same way. This process is repeated k times. After kth encoding they exchange their message.
The length of the message is always less or equal than n. If the message is shorter than n, then spaces are added to the end of the message to get the message with the length n.
Help Alice and Bob and write program which reads the key and then a sequence of pairs consisting of k and message to be encoded k times and produces a list of encoded messages.
Input
The input file consists of several blocks. Each block has a number in the first line. The next line contains a sequence of n numbers pairwise distinct and each greater than zero and less or equal than n. Next lines contain integer number k and one message of ascii characters separated by one space. The lines are ended with eol, this eol does not belong to the message. The block ends with the separate line with the number 0. After the last block there is in separate line the number 0.
Output
Output is divided into blocks corresponding to the input blocks. Each block contains the encoded input messages in the same order as in input file. Each encoded message in the output file has the lenght n. After each block there is one empty line.
Sample Input
10 4 5 3 7 2 8 1 6 10 9 1 Hello Bob 1995 CERC 0 0
Sample Output
BolHeol b C RCE
hide comments
void11_tengis:
20151201 07:16:38
ghdht


Sivakumaran M:
20140418 11:35:47
don't know why Im getting wa. Seems to work fine. soln id: 11456077 

Jumpy:
20140327 19:33:34
don't know why getting RTE again and again Last edit: 20140327 19:33:51 

DINESH JANGID:
20121207 16:16:47
here is 1995 a value of k?? 

(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
20120422 18:42:12
Based on my experiment, k<32768 

:D:
20110914 18:34:58
k will fit into 32bit signed integer. That limitation should be enough. Last edit: 20110914 18:37:55 

cegprakash:
20110914 12:27:36
limit for k?? 
Added by:  Andres Tellez 
Date:  20110912 
Time limit:  0.681s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 