#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=100100;
const int MAX=100000000;
const int mod=100000000;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=998244353;
const ll INF=10000000010;
typedef double db;
typedef unsigned long long ull;
int tot,u[N],v[N],w[N],pre[N];
void add(int x,int y,int z) {
v[tot]=y;w[tot]=z;pre[tot]=u[x];u[x]=tot++;
}
char s[N];
struct trie {
int g,m,sz,X[N],fa[N],val[N],fail[N],tr[N][26];
int ttot,tu[N],tv[N],tpre[N];
int k,in[N],out[N];
void trie_clear() {
k=g=m=sz=ttot=0;
memset(tu,-1,sizeof(tu));
}
void trie_insert(char *ch) {
while (*ch!='\0') {
if (*ch=='B') { m=fa[m];ch++;continue ; }
if (*ch=='P') { val[m]=++g;X[g]=m;ch++;continue ; }
if (tr[m][*ch-'a']) { m=tr[m][*ch-'a'];ch++; }
else { fa[sz+1]=m;tr[m][*ch-'a']=++sz;m=sz;ch++; }
}
}
void trie_build() {
queue<int>Q;
for (int i=0;i<26;i++)
if (tr[0][i]) Q.push(tr[0][i]);
while (!Q.empty()) {
int now=Q.front();Q.pop();
for (int i=0;i<26;i++)
if (tr[now][i]) {
fail[tr[now][i]]=tr[fail[now]][i];
Q.push(tr[now][i]);
} else tr[now][i]=tr[fail[now]][i];
}
}
void add(int x,int y) {
tv[ttot]=y;tpre[ttot]=tu[x];tu[x]=ttot++;
}
void add_b() {
for (int i=0;i<=sz;i++)
if (fail[i]!=i) add(fail[i],i);
}
void dfs(int x) {
k++;in[x]=k;
for (int i=tu[x];i!=-1;i=tpre[i]) dfs(tv[i]);
out[x]=k;
}
}ac;
int len,f[N],ans[N];
void updata(int x,int y) {
for (;x<=len+1;x+=x&(-x)) f[x]+=y;
}
int getsum(int x) {
int ret=0;
for (;x;x-=x&(-x)) ret+=f[x];
return ret;
}
int main()
{
int i,j,n,x,y;
scanf("%s", s);
ac.trie_clear();
ac.trie_insert(s);
ac.trie_build();
ac.add_b();ac.dfs(0);
scanf("%d", &n);
tot=0;memset(u,-1,sizeof(u));
for (i=1;i<=n;i++) {
scanf("%d%d", &x, &y);add(y,x,i);
}
len=strlen(s);x=0;
memset(f,0,sizeof(f));
for (i=0;i<len;i++) {
if (s[i]=='B') {
updata(ac.in[x],-1);x=ac.fa[x];continue ;
}
if (s[i]=='P') {
for (j=u[ac.val[x]];j!=-1;j=pre[j]) {
ans[w[j]]=getsum(ac.out[ac.X[v[j]]])-getsum(ac.in[ac.X[v[j]]]-1);
}
continue ;
}
x=ac.tr[x][s[i]-'a'];updata(ac.in[x],1);
}
for (i=1;i<=n;i++) printf("%d\n", ans[i]);
return 0;
}