#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define N 1000001
using namespace std;
queue<int> q;
int nt[N][26] , fa[N] , fail[N] , cnt[N] , tot = 1 , pos[N] , p , c , head[N] , to[N] , nextn[N] , l[N] , r[N] , f[N << 1] , k , ans[N];
char str[N];
vector<int> son[N];
void add(int x , int y)
{to[++c] = y;nextn[c] = head[x];head[x] = c;
}
void build()
{int u , t , i;q.push(1);while(!q.empty()){u = q.front();q.pop();for(i = 0 ; i < 26 ; i ++ ){if(nt[u][i]){q.push(nt[u][i]);t = fail[u];while(t && !nt[t][i])t = fail[t];if(t) fail[nt[u][i]] = nt[t][i];else fail[nt[u][i]] = 1;}}}
}
void dfs(int x)
{l[x] = ++k;int i;for(i = 0 ; i < (int)son[x].size() ; i ++ )dfs(son[x][i]);r[x] = ++k;
}
void update(int x , int a)
{int i;for(i = x ; i <= k ; i += i & -i)f[i] += a;
}
int query(int x)
{int i , ans = 0;for(i = x ; i ; i -= i & -i)ans += f[i];return ans;
}
void solve()
{int now = 1 , id = 0 , i , j , len = strlen(str);update(l[1] , 1);for(i = 0 ; i < len ; i ++ ){if(str[i] == 'P')for(j = head[++id] ; j ; j = nextn[j])ans[j] += query(r[pos[to[j]]]) - query(l[pos[to[j]]] - 1);else if(str[i] == 'B'){update(r[now] , -1);now = fa[now];}else{now = nt[now][str[i] - 'a'];update(l[now] , 1);}}
}
int main()
{int i , t = 1 , len , x , y , m;scanf("%s" , str);len = strlen(str);for(i = 0 ; i < len ; i ++ ){if(str[i] == 'P'){cnt[t] ++ ;pos[++p] = t;}else if(str[i] == 'B')t = fa[t];else{if(!nt[t][str[i] - 'a'])nt[t][str[i] - 'a'] = ++tot;fa[nt[t][str[i] - 'a']] = t;t = nt[t][str[i] - 'a'];}}build();for(i = 1 ; i <= tot ; i ++ )son[fail[i]].push_back(i);dfs(1);scanf("%d" , &m);for(i = 1 ; i <= m ; i ++ ){scanf("%d%d" , &x , &y);add(y , x);}solve();for(i = 1 ; i <= m ; i ++ )printf("%d\n" , ans[i]);return 0;
}