字符串最小循环节（不相交）

//https://codeforces.com/problemset/problem/1690/F
#include<bits/stdc++.h>
#include<unordered_map>
#include<array>
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(),a.end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;

int n, p[205], vis[205];
string s;

void solve()
{
	cin >> n;
	cin >> s;
	for (int i = 1; i <= n; i++)
		vis[i] = 0;
	for (int i = 1; i <= n; i++)
		cin >> p[i];
	ll cnt = 0;
	vector<ll> v;
	while (cnt != n)
	{
		string res = "";
		for (int i = 1; i <= n; i++)
		{
			if (!vis[i])
			{
				vis[i] = 1;
				cnt++;
				res += s[i - 1];
				int x = p[i];
				while (!vis[x])
				{
					vis[x] = 1;
					cnt++;
					res += s[x - 1];
					x = p[x];
				}
				break;
			}
		}
		int cnt = (res + res).find(res, 1);//将字符串放大一倍，来求字符串循环长度
		v.push_back(cnt);
	}
	ll ans = 1;
	for (auto it : v)
		ans = lcm(it, ans);
	cout << ans << '\n';
}

signed main()
{
	IOS;
	int t = 1;
	cin >> t;
	while (t--)
		solve();
	return 0;
}