poj1026

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=205;
int n,a[N],b[N],p[N],k;
char s[N];
void ksm(int x)
{
    if (!x)
     {
         for (int i=1;i<=n;i++)a[i]=i;
         return;
     }
    ksm(x/2);
    for (int i=1;i<=n;i++)b[i]=a[a[i]];
    for (int i=1;i<=n;i++)a[i]=b[i];
    for (int i=1;i<=n;i++)
     if (x%2==1)b[i]=p[a[i]];
    for (int i=1;i<=n;i++)a[i]=b[i];
    return; 
}
int main()
{
    while (scanf("%d",&n),n)
     {
         for (int i=1;i<=n;i++)scanf("%d",&p[i]);
         while (scanf("%d",&k),k)
          {
              getchar();
              ksm(k);
              memset(s,0,sizeof s);
              gets(s+1);
              for (int i=strlen(s+1)+1;i<=n;i++)s[i]=‘ ‘;
              for (int i=1;i<=n;i++)b[a[i]]=i; 
              for (int i=1;i<=n;i++)putchar(s[b[i]]);
            puts("");
          }
         puts(""); 
     }
    return 0; 
}