poj 2015

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int

using namespace std;

int n, x, d;
char s[333], p[333], c[333], m[333];
int spos[333];

int main(){
	while (scanf("%d", &x), x){
		scanf("%s%s%s", s, p, c);

		int len = strlen(s);
		for (int i = 0; i < len; i++)
			spos[s[i]] = i;
		n = strlen(c);
		d = (int(pow(n, 1.5) + x)) % n;
		m[d] = p[spos[c[d]]];

		for (int i = d + n - 1; i > d; i--){
			int t = i % n;
			m[t] = p[spos[c[t]] ^ spos[m[(t + 1) % n]]];
		}

		m[n] = '\0';
		printf("%s\n", m);
	}
	return 0;
}