#include<bits/stdc++.h>
#define ll long long
#define pii make_pair
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
const ll inf = 1145141919810;
using namespace std;
inline ll read() {
	ll x=0,f=1;
	char c=getchar();
	while (c<'0' || c>'9') {
		if (c=='-')  f=-1;
		c=getchar();
	}
	while (c>='0' && c<='9') {
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}
inline void print(ll x) {
	if(x < 0) putchar('-'), x = -x;
	if(x > 9) print(x / 10);
	putchar(x % 10 + '0');
	return ;
}
/*
deque<int> ideq
//b)增加函数
 ideq.push_front( x):双端队列头部增加一个元素X
 ideq.push_back(x):双端队列尾部增加一个元素x
//c)删除函数
ideq.pop_front():删除双端队列中最前一个元素
ideq.pop_back():删除双端队列中最后一个元素
ideq.clear():清空双端队列中元素
//d)判断函数
ideq.empty() :向量是否为空，若true,则向量中无元素
//e)大小函数
ideq.size():返回向量中元素的个数
*/
inline void pprint(ll x) {
	print(x);
	puts("");
}
void slv() {
	int n = read();
	vector<int> a(n, 0);
	vector<int> b(n, 0);
	map<int, int> mp;
	rep(i, 1, n) a[i] = read();
	rep(i, 1, n) b[i] = read();
	rep(i, 1, n) mp[b[i]] = i;
	rep(i, 1, n) a[i] = mp[a[i]];
	deque<int> q;
	rep(i, 1, n) q.push_back(a[i]);

	rep(k, 1, n) {
		rep(j, 1, n) {
			if(q.front() != k) {
				int tmp = q.front();
				q.pop_front();
				q.push_back(tmp);
				putchar('1');
			} else {
				//第一个元素是k
				if(j == n) {
					q.pop_front();
					q.push_back(k);
					putchar('1');
				} else {
					q.pop_front();//弹出k
					int tmp = q.front();
					q.pop_front();
					q.push_back(tmp);
					q.push_front(k);
					putchar('2');
				}
			}
		}
	}
}
int main() {
	int T = read();
	while(T--) {
		slv();
	}
	return 0;
}