#include<iostream>
#include<stdio.h>
#include<ctype.h>
#include<string.h>
#include<map>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pii pair<int,int>
#define lowbit(x) ((x)&-(x))
#define popcount(x) __builtin_popcount(x)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define umap unordered_map
#define all(x) x.begin(),x.end()
#define mk make_pair
#define pb push_back
#define ckmax(x,y) x=max(x,y)
#define ckmin(x,y) x=min(x,y)
#define rep(i,l,r) for(int i=l;i<=r;++i)
#define per(i,r,l) for(int i=r;i>=l;--i)
#define int long long
using namespace std;
inline int read(){
	int x=0,f=0; char ch=getchar();
	while(!isdigit(ch)) f|=(ch==45),ch=getchar();
	while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}
#define N 100005
const __int128 mo=1000000000000000003;
__int128 ha[N],bas=37,pre[N],b[N];
inline void red(__int128 &x){x>=mo?x-=mo:0;}
int n,m,q,f[N][17];
char s[N];
map<__int128,int> mp;
inline __int128 query(int l,int r){
	return (pre[r]-pre[l-1]*b[r-l+1]%mo+mo)%mo;
}
signed main(){
	for(int cas=read();cas--;){
		mp.clear();
		n=read(),m=read(),q=read();
		mp[0]=0;
		b[0]=1;
		for(int i=1;i<=max(n,m);++i) b[i]=b[i-1]*bas%mo;
		for(int i=1;i<=n;++i){
			int x=read();char c=getchar();
			red(ha[i]=ha[x]*bas%mo+c-'a'+1);
			mp[ha[i]]=i;
		}
		scanf("%s",s+1);
		for(int i=1;i<=m;++i){
			red(pre[i]=pre[i-1]*bas%mo+s[i]-'a'+1);
		}
		for(int i=1;i<=m;++i){
			int l=i,r=m;
			while(l<=r){
				int mid=l+r>>1;
				if(mp.count(query(i,mid))) l=mid+1;
				else r=mid-1;
			}
			f[i][0]=min(m+1,r+2);
		}
		for(int j=0;j<17;++j) f[m+1][j]=m+1;
		for(int j=1;j<17;++j){
			for(int i=1;i<=m;++i){
				f[i][j]=f[f[i][j-1]][j-1];
			}
		}
		for(int i=1;i<=q;++i){
			int L=read(),R=read();
			int cnt=0,dst;
			for(int j=16;~j;--j){
				if(f[L][j]<=R) L=f[L][j],cnt|=(1<<j);
			}
			if(mp.count(query(L,R))) dst=mp[query(L,R)];
			else dst=0,cnt++;
			printf("%lld %lld\n",cnt,dst);
		}
	}
	return 0;
}