#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000009;
const int mod17 = 1000000007;
const ll INF = (ll)mod17 * mod17;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//------------------------------------

//ll dp[27][27][27][3];
//void init() {
//	dp[1][0][0][0] = 1;
//	rep(i, 26)rep(j, 26)rep(k, 26) {
//		rep(las, 3) {
//			rep(nex, 3) {
//				int ni = i, nj = j, nk = k;
//				if (nex == 0)ni++;
//				else if (nex == 1)nj++;
//				else nk++;
//				if (las == 1 && nex == 1)continue;
//				if (ni < nj || ni < nk || nj < nk)continue;
//				dp[ni][nj][nk][nex] += dp[i][j][k][las];
//			}
//		}
//	}
//	for (int n = 1; n <= 25; n++) {
//		ll sum = 0;
//		rep(l, 3)sum += dp[n][n][n][l];
//		cout << n << " " << sum << "\n";
//	}
//}

ll dp[27];
ll dp2[27];
void init() {
	dp[0] = 1;
	dp2[0] = 1;
	for (int n = 1; n <= 25; n++) {
		ll val = 0;
		for (int cl = 0; cl <= n - 1; cl++) {
			int cr = n - 1 - cl;
			val += dp[cl] * dp[cr];
		}
		dp2[n] = val;
		for (int cl = 1; cl <= n; cl++) {
			dp[n] += dp2[cl] * dp[n - cl];
		}
		//cout << n << " " << dp[n] << "\n";
	}
}
string get_st(int n, ll v);

string get_st2(int n, ll v) {
	assert(v < dp2[n]);
	string res;
	res.push_back('(');
	for (int cl = 0; cl <= n - 1; cl++) {
		int cr = n - 1 - cl;
		ll num = dp[cl] * dp[cr];
		if (v < num) {
			ll d = v / dp[cl];
			ll r = v % dp[cl];
			res += get_st(cl, r);
			res.push_back('|');
			res += get_st(cr, d);
			break;
		}
		else {
			v -= num;
		}
	}
	res.push_back(')');
	return res;
}
string get_st(int n, ll v) {
	assert(v < dp[n]);
	string res;
	if (n == 0)return res;
	for (int cl = 1; cl <= n; cl++) {
		ll num = dp2[cl] * dp[n - cl];
		if (v < num) {
			ll d = v / dp2[cl];
			ll r = v % dp2[cl];
			res += get_st2(cl, r);
			res += get_st(n - cl, d);
			break;
		}
		else {
			v -= num;
		}
	}
	return res;
}

ll trans_st(string s);

ll trans2_st(string s) {
	int n = s.size() / 3;
	assert(s.size() == 3 * n);
	assert(s[0] == '(');
	assert(s.back() == ')');
	int c = 0;

	int ccl = -1;
	for (int i = 1; i < s.size(); i++) {
		if (s[i] == '(')c++;
		else if (s[i] == ')')c--;
		else {
			assert(s[i] == '|');
			if (c == 0) {
				ccl = (i - 1);
				assert(ccl % 3 == 0);
				ccl /= 3;
			}
		}
	}
	assert(ccl >= 0);
	ll res = 0;
	for (int cl = 0; cl <= n - 1; cl++) {
		int cr = n - 1 - cl;
		ll num = dp[cl] * dp[cr];
		if (cl == ccl) {
			string sl = s.substr(1, 3*cl);
			string sr = s.substr(2 + 3 * cl, 3 * cr);
			ll vl = trans_st(sl);
			ll vr = trans_st(sr);
			res += vl + vr * dp[cl];
			break;
		}
		else {
			res += num;
		}
	}
	return res;
}

ll trans_st(string s) {
	if (s.empty())return 0;
	vector<int> c0s;
	int c = 0;
	rep(i, s.size()) {
		if (s[i] == '(')c++;
		else if (s[i] == ')')c--;
		if (c == 0) {
			assert((i + 1) % 3 == 0);
			c0s.push_back(i + 1);
		}
	}
	int n = s.size() / 3;
	assert(s.size() == 3 * n);
	ll res = 0;
	int ccl = c0s[0] / 3;
	for (int cl = 1; cl <= n; cl++) {
		ll num = dp2[cl] * dp[n - cl];
		if (cl == ccl) {
			string sl = s.substr(0, c0s[0]);
			string sr = s.substr(c0s[0], s.size() - c0s[0]);
			ll vl = trans2_st(sl);
			ll vr = trans_st(sr);
			res += vl + vr * dp2[cl];
			break;
		}
		else {
			res += num;
		}
	}
	return res;
}
void sol_encode() {
	int n; cin >> n;
	string s; cin >> s;
	ll v = trans_st(s);
	cout << v << "\n";
}
void sol_decode() {
	int n; cin >> n;
	ll v; cin >> v;
	string ans = get_st(n, v);
	cout << ans << "\n";
}

void solve() {
	string in; cin >> in;
	if (in == "encode") {
		int t; cin >> t;
		rep(i, t) {
			sol_encode();
		}
	}
	else {
		int t; cin >> t;
		rep(i, t) {
			sol_decode();
		}
	}
}



signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed<<setprecision(10);
	//init_f();
	init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}