#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<queue>
#define MAXN 100005
using namespace std;
int m,sz,root,pos[MAXN],in[MAXN],out[MAXN],dfn_clock=0,c[MAXN],ans[MAXN],dfn[MAXN];
int head1[MAXN],head2[MAXN],cnt1=0,cnt2=0;
struct Node2
{int next,to;
}e1[MAXN],e2[MAXN];
void addedge1(int u,int v)
{e1[++cnt1].next=head1[u];head1[u]=cnt1;e1[cnt1].to=v;
}
void addedge2(int u,int v)
{e2[++cnt2].next=head2[u];head2[u]=cnt2;e2[cnt2].to=v;
}
char s[MAXN];
struct Node1
{int next[26],par,fail;
}trie[MAXN];
int newnode(int f)
{trie[++sz].fail=0;trie[sz].par=f;memset(trie[sz].next,0,sizeof(trie[sz].next));return sz;
}
void insert()
{sz=0,root=newnode(0);int i=0,p=root,_clock=0;while(s[i]){if(s[i]=='B')p=trie[p].par;else if(s[i]=='P')pos[++_clock]=p;else {int idx=s[i]-'a';if(!trie[p].next[idx])trie[p].next[idx]=newnode(p);p=trie[p].next[idx];}i++;}
}
queue<int>q;
void build()
{q.push(root);while(!q.empty()){int p=q.front();q.pop();for(int i=0;i<26;i++){int t=trie[p].fail;while(t&&!trie[t].next[i])t=trie[t].fail;if(trie[p].next[i]){trie[trie[p].next[i]].fail=t?trie[t].next[i]:root;q.push(trie[p].next[i]);}else trie[p].next[i]=t?trie[t].next[i]:root;}}
}
void dfs(int u)
{if(dfn[u])return; ++dfn_clock;in[u]=dfn[u]=dfn_clock;for(int i=head1[u];~i;i=e1[i].next)dfs(e1[i].to);out[u]=dfn_clock;
}
int lowbit(int x){return x&(-x);}
void add(int x,int p)
{while(p<=sz+1){c[p]+=x;p+=lowbit(p);}
}
int query(int p)
{int res=0;while(p>0){res+=c[p];p-=lowbit(p);}return res;
}
void solve()
{int i=0,p=root,_clock=0;while(s[i]){if(s[i]=='B')add(-1,dfn[p]),p=trie[p].par;else if(s[i]=='P'){++_clock;for(int j=head2[_clock];~j;j=e2[j].next){int t=e2[j].to;ans[j]=query(out[pos[t]])-query(in[pos[t]]-1);}}else{int idx=s[i]-'a';p=trie[p].next[idx];add(1,dfn[p]);}i++;}
}
int main()
{memset(head1,-1,sizeof(head1));memset(head2,-1,sizeof(head2));scanf("%s",s); insert(),build();for(int i=1;i<=sz;i++)addedge1(trie[i].fail,i);scanf("%d",&m);for(int i=1;i<=m;i++){int x,y;scanf("%d%d",&x,&y);addedge2(y,x);}dfs(0);solve();for(int i=1;i<=m;i++)printf("%d\n",ans[i]);return 0;
}