poj1026 Cipher（翻译）

译文

题目描述

Bob和Alice发明了一种全新的编码方法。
令人惊讶的是，ta不是一个公钥密码系统，然而ta们的编码和解码还是基于密钥的。1996年2月16日，ta们在费城举行的最后一次会议上选择了密钥。他们选择了$n$个不同的整数$a_i$作为密钥：$a_1,a_2,...,a_n;0<a_i<=n$。
编码基于以下原则：把信息写在密钥的下方，使信息中的字符和密钥中的数字相应对齐。在位置$i$处的消息字符被写入位置$a_i$处，其中$a_i$是密钥中相应的编号。得到的消息以相同的方式继续被编码。这个过程重复$k$次。第$k$个编码即是最后答案。

消息的长度总是小于或等于$n$。如果消息比$n$短，则在消息的末尾添加空格以获取长度为$n$的消息。

你需要帮助Alice和Bob编写一个读取密钥的程序，进行$k$次编码，产生编码消息。

输入

输入文件由几部分组成。每个部分在第一行有一个数组$n：0 <n <= 200$。下一行是一个包含n个数字的序列，每个数字两两不同，每个大于零，小于或等于$n$。下一行包含一个整数$k$和一个由一个空格分隔的$ascii$字符消息。每一行以$eol$结尾，这个$eol$不属于消息。该部分以数字0的单独行结束。在最后一个部分之后，单独输入一行一个0。

输出

对于每一部分输出答案。按照输入顺序输出编码后的信息。输出文件中的每个编码信息长度都为 n n <script type="math/tex" id="MathJax-Element-45">n</script>。每部分后有一个空行。

样例输入

10
4 5 3 7 2 8 1 6 10 9
1 Hello Bob
1995 CERC
0
0

样例输出

BolHeol b
C RCE

原文

Description

Bob and Alice started to use a brand-new 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, a1 ; …; an, 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 ai, where ai 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 0 < n <= 200 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