POJ 1026

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;


int n;
int chan[210];
int partic[210],np;
bool vis[210];
char s[210];
char ans[210];

int main(){
	int k;
	while(scanf("%d",&n),n){
		for(int i=1;i<=n;i++)
		scanf("%d",&chan[i]);
		while(scanf("%d",&k),k){
			getchar();
			gets(s+1);
			memset(vis,false,sizeof(vis));
			if(strlen(s+1)<n){
				for(int i=strlen(s+1)+1;i<=n;i++)
				s[i]=‘ ‘;
				s[n+1]=‘\0‘;
			}
			for(int i=1;i<=n;i++){
				np=0;
				if(!vis[i]){
					while(!vis[i]){
						vis[i]=true;
						partic[np++]=i;
						i=chan[i];
					}
					for(int p=0;p<np;p++){
						ans[partic[(p+k)%np]]=s[partic[p]];
					}
				}
			}
			ans[n+1]=‘\0‘;
			cout<<ans+1<<endl;
		}
		cout<<endl;
	}
	return 0;
}