#include "iostream"
#include "cstring"
#include "cstdio"
#include "algorithm"
#include "queue"
#include "vector"
#include "queue"
#include "stack"
#include "ctime"
#include "set"
#include "map"
#include "bitset"
using namespace std;
#define fi first
#define se second
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define mp make_pair
#define rep( i , a , b ) for( int i = (a) , i##end = b ; i <= i##end ; ++ i )
#define per( i , a , b ) for( int i = (a) , i##end = b ; i >= i##end ; -- i )
#define mem( a ) memset( a , 0 , sizeof (a) )
#define all( x ) x.begin() , x.end()
//#define int long long
typedef long long ll;
const int MAXN = 2e3 + 10;
const int P = 998244353;
int n , q;

struct tr {
	int v; string S;
	tr( ) = default;
	tr( int l , string t ) : v(l) , S(t) {}
	
};

vector<tr> G[MAXN];

int loop[MAXN] , vis[MAXN] , cid , ins[MAXN];
ll le[MAXN];
void dfs( int u ) {
	if( ins[u] ) {
		loop[u] = 1; return;
	} else if( vis[u] == cid ) {
		return;
	} else le[u] = 0;
	vis[u] = cid , ins[u] = 1;
	for( auto& t : G[u] ) {
		le[u] += t.S.length();
		if( t.v ) {
			dfs( t.v );
			if( !loop[t.v] ) le[u] += le[t.v];
			loop[u] |= loop[t.v];
		}
		if( le[u] > 2e18 ) le[u] = 2e18;
	}
	ins[u] = 0;
}

int plen[MAXN] , flg = 0;
char que( int u , int c ) {
	if( plen[u] && !flg ) {
		int l = plen[u] - c;
		c = c % l , c = ( !c ? l : c ) , flg = 1;
	}
	plen[u] = c;
	for( auto& t : G[u] ) {
		if( c <= t.S.length() ) return t.S[c - 1];
		c -= t.S.length();
		if( t.v == 0 ) return 0;
		if( loop[t.v] ) return que( t.v , c );
		else {
			if( c <= le[t.v] ) return que( t.v , c );
			c -= le[t.v];
		}
	}
}

char ch[MAXN];
void solve() {
	cin >> n >> q;
	rep( i , 1 , n ) {
		int x;
		scanf("\n[%d]->",&x);
		scanf("%s",ch + 1);
		int l = strlen( ch + 1 ) , ot = 0;
		G[x].eb( 0 , "" );
		rep( i , 1 , l ) {
			if( ch[i] == '[' ) {
				++ i;
				int ret = 0;
				while( ch[i] >= '0' && ch[i] <= '9' ) ret = ret * 10 + ch[i] - '0' , ++ i;
				G[x].back().v = ret;
				G[x].eb( 0 , "" );
			} else {
				G[x].back().S.pb( ch[i] );
			}
		}
	}
	rep( i , 1 , n ) cid = i , dfs( i );
//	cout << le[2] << endl;
	rep( i , 1 , q ) {
		int u;
		ll l;
		scanf("%d%lld",&u,&l);
		flg = 0;
		char as = que( u , l );
		if( as ) putchar( as ) , puts("");
		else puts("-1");
		rep( i , 1 , n ) plen[i] = 0;
	}
}

signed main() {
//	freopen("in","r",stdin);
//	freopen("out","w",stdout);
	int T;cin >> T;while( T-- ) solve();
//	solve();
}