//by 72
#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)
#define Fd(i, a, b) for(int i = a; i >= b; i --)
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
using namespace std;

const int mod = 998244353;
const int N = 2e5 + 10;
const int inf = 1e18;
typedef array<int, 3> a3; 
typedef long long ll;
const int mod1 = 998244353;
const int mod2 = 1e9 + 9;
const int base1 = 250316;
const int base2 = 171925;

int n, m, q;
vector<pair<int, char>> ed[N];

struct Hash {
	int n; string s;
	vector<pii> ha, pw;
	void init(string t){
		s = t;
		n = s.size();
		ha.resize(n + 1), pw.resize(n + 1);
		pw[0] = {1, 1};
		F(i, 1, n) {
			pw[i].fi = 1ll * pw[i - 1].fi * base1 % mod1;
			pw[i].se = 1ll * pw[i - 1].se * base2 % mod2;
		}
		F(i, 1, n) {
			ha[i].fi = (1ll * ha[i - 1].fi * base1 + s[i - 1]) % mod1;
			ha[i].se = (1ll * ha[i - 1].se * base2 + s[i - 1]) % mod2;
		}
	}
	pii hsh(int l, int r) {
		int f1 = (ha[r].fi - (1ll * ha[l - 1].fi * pw[r - l + 1].fi) % mod1 + mod1) % mod1;
		int f2 = (ha[r].se - (1ll * ha[l - 1].se * pw[r - l + 1].se) % mod2 + mod2) % mod2;
		return {f1, f2};
	}
};
pii now;
map<pii, int> mp;
void dfs(int u) {
    for(auto [v, c] : ed[u]) {
        pii lst = now;
        now.fi = (1ll * lst.fi * base1 + c) % mod1;
        now.se = (1ll * lst.se * base2 + c) % mod2;
        mp[now] = v;
        dfs(v);
        now = lst;
    }
}
int nxt[20][N];

void sol() {
    cin >> n >> m >> q;
    F(i, 0, n) ed[i].clear();
    F(i, 0, 19) F(j, 1, m) nxt[i][j] = 0;
    F(i, 1, n) {
        int x; char c; cin >> x >> c;
        ed[x].push_back({i, c});
    }
    string s; cin >> s;
    Hash H; H.init(s);
    s = " " + s, now = {0, 0}, mp.clear();
    dfs(0);
    F(i, 1, m) {
        int l = i - 1, r = m;
        auto check = [&](int x) -> bool {
            if(x == i - 1) return true;
            if(mp.count(H.hsh(i, x))) return true;
            else return false;
        };
        while(l < r) {
            int mid = l + r + 1 >> 1;
            if(check(mid)) l = mid;
            else r = mid - 1;
        }
        nxt[0][i] = min(m + 1, l + 1);   
        // cout << i << " " << nxt[0][i] << "!\n";
        // cout << nxt[0][i] << " \n" [i == n];
    }
    F(i, 1, 19) F(j, 1, m) {
        if(nxt[i - 1][j] >= m) nxt[i][j] = m + 1;
        else nxt[i][j] = nxt[i - 1][nxt[i - 1][j] + 1];
    }
    F(i, 1, q) {
        int l, r; cin >> l >> r;
        int res = 0;
        // cout << l << " " << r << ":\n";
        Fd(j, 19, 0) {
            if(nxt[j][l] < r) {
                l = nxt[j][l] + 1;
                res += (1 << j);
                // cout << j << " " << l << "??\n";
            } 
        } 
        if(l == r) {
            if(mp.count(H.hsh(l, r))) cout << res << " " << mp[H.hsh(l, r)] << "\n";
            else cout << res + 1 << " " << 0 << "\n";
            continue;
        }  
        if(mp.count(H.hsh(l, r))) {
            cout << res << " " << mp[H.hsh(l, r)] << "\n";
        } else {
            assert(mp.count(H.hsh(l, r - 1)));
            cout << res + 1 << " " << 0 << "\n";
        } 
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t; cin >> t;
    F(i, 1, t) sol();
    return 0;
}
//sldl