#include<bits/stdc++.h>
using namespace std;
const int N = 5e5+7;
char ch[N*2];
int Id[N*2],p[N*2],k=1;
struct String
{
	vector<char> S;
	vector<int> radius[2],border,suffix;
	int len,n=0;
	void init()
	{
		border.resize(len+1);
		radius[0].resize(len+1);
		radius[1].resize(len+1);
		suffix.resize(len+1);
		n=0;
		ch[++n]='$';Id[n]=0;
		ch[++n]='#';Id[n]=0;
		for(int i=1;i<=len;i++)
		{
			ch[++n]=S[i];Id[n]=i;
			ch[++n]='#'; Id[n]=0;
		}
		ch[++n]='@';Id[n]=0;
	}
	void manacher()
	{
		init();
		for(int i=1;i<=n;i++)p[i]=0;
		p[1]=1;
		int r=1,mid=1;
		for(int i=2;i<=n;i++)
		{
			if(i<=r)p[i]=min(r-i+1,p[mid-(i-mid)]);
			while(ch[i-p[i]]==ch[i+p[i]])
			{
				if(Id[i+p[i]])suffix[Id[i+p[i]]]=max(suffix[Id[i+p[i]]],p[i]+1);
				p[i]++;
			}
			if(i+p[i]-1>r)
			{
				r=i+p[i]-1;
				mid=i;
			}
			if(Id[i])radius[1][Id[i]]=p[i]-1;
			else if(Id[i-1])radius[0][Id[i-1]]=max(radius[0][Id[i-1]],p[i]-1);
		}
	}
	bool pan(int l,int r)
	{
		if((r-l+1)&1)return radius[1][(l+r)/2]>=r-l+1;
		return radius[0][(l+r)/2]>=r-l+1;
	}
	inline bool palindromic(int o,int l,int r)
	{
		int p=(o-1)/2+1,c=o%2;
		if(c==1)
		{
			if(p-(r-p)<l)return 0;
			if(p+radius[c][p]/2<r)return 0;
			return 1;
		}
		if(p-(r-p)+1<l)return 0;
		if(p+radius[c][p]/2<r) return 0;
		return 1;
	}
	int query(int l,int r)
	{
		while(!palindromic(k,l,r))k++;
		int p=(k-1)/2+1,c=k%2;
		return min(radius[c][p]/2,r-p)*2+c;
	}
	void Kmp()
	{
		border[1]=0;
		int j=0;
		k=1;
		for(int i=2;i<=len;i++)
		{
			while(j&&suffix[j+1]!=query(i-j,i))j=border[j];
			if(suffix[j+1]==query(i-j,i))j++;
			border[i]=j;
		}
	}
}A[N];
void Kmp(int x,int y)
{
	int j=0;k=1;
	int ans=0;
	for(int i=1;i<=A[y].len;i++)
	{
		while(j&&A[x].suffix[j+1]!=A[y].query(i-j,i))j=A[x].border[j];
		if(A[x].suffix[j+1]==A[y].query(i-j,i))j++;
		if(j==A[x].len) 
		{
			j=A[x].border[j];
			ans++;
		}
	}
	printf("%d\n",ans);
}
int T,n,q;
char str[N];
int main()
{
	scanf("%d %d %d",&T,&n,&q);
	for(int i=1;i<=n;i++)
	{
		scanf("%s",str+1);
		int m=strlen(str+1);
		A[i].S.push_back('!');
		for(int j=1;j<=m;j++)
		A[i].S.push_back(str[j]);
		A[i].len=m;
		A[i].manacher();
		A[i].Kmp();
	}
	while(q--)
	{
		int x,y;
		scanf("%d %d",&x,&y);
		Kmp(x,y);
	}
	return 0;
}