#include<bits/stdc++.h>

#define LL long long

#define ll long long

#define fi first

#define se second

#define mk make_pair

#define PII pair<int, int>

#define y1 skldjfskldjg

#define y2 skldfjsklejg

using namespace std;

const int N = 2e5 + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = ;

int n, m, pos, ans[N], t[N];

char s[N];

struct Qus {

    int x, y, id;

    bool operator < (const Qus &rhs) const {

        return y < rhs.y;

    }

} qus[N];

struct BIT {

    int a[N];

    void modify(int x, int v) {

        for(int i = x; i < N; i += i & -i)

            a[i] += v;

    }

    int sum(int x) {

        int ans = ;

        for(int i = x; i; i -= i & -i)

            ans += a[i];

        return ans;

    }

} bit;

struct Ac {

    int ch[N][], val[N], dp[N], f[N], L[N], R[N], tot, sz, cnt, all;

    bool vis[N];

    vector<PII> vec[N];

    vector<int> edge[N];

    Ac(int sz) {this->sz = sz;}

    void init() {tot = ;}

    int newNode() {

        tot++; f[tot] = ; val[tot] = ;

        memset(ch[tot], , sizeof(ch[tot]));

        return tot;

    }

    inline int idx(char c) {return c - 'a';}

    void addStr(char *s) {

        stack<int> stk;

        int u = ;

        stk.push();

        for(int i = ; s[i]; i++) {

            if(s[i] == 'P') {

                cnt++; val[u]++; t[cnt] = u;

                while(pos <= n && qus[pos].y <= cnt)

                    vec[u].push_back(mk(qus[pos].x, qus[pos].id)), pos++;

            } else if(s[i] == 'B') {

                if(stk.size() > ) {

                    stk.pop();

                    u = stk.top();

                }

            } else {

                int c = idx(s[i]);

                if(!ch[u][c]) ch[u][c] = newNode();

                u = ch[u][c];

                stk.push(u);

            }

        }

    }

    void build() {

        queue<int> que;

        for(int c = ; c < sz; c++) {

            int v = ch[][c];

            if(!v) ch[][c] = ;

            else f[v] = , que.push(v);

        }

        while(!que.empty()) {

            int u = que.front(); que.pop();

            val[u] |= val[f[u]];

            for(int c = ; c < sz; c++) {

                int v = ch[u][c];

                if(!v) ch[u][c] = ch[f[u]][c];

                else f[v] = ch[f[u]][c], que.push(v);

            }

        }

    }

    void dfs(int u) {

        L[u] = ++all;

        for(int i = ; i < edge[u].size(); i++) {

            int v = edge[u][i];

            dfs(v);

        }

        R[u] = all;

    }

    void solve(char *s) {

        for(int i = ; i <= tot; i++)

            edge[f[i]].push_back(i);

        dfs();

        stack<int> stk;

        int u = ;

        stk.push();

        bit.modify(L[], );

        for(int i = ; s[i]; i++) {

            if(s[i] == 'P') {

                if(vis[u]) continue;

                vis[u] = true;

                for(int i = ; i < vec[u].size(); i++) {

                    int x = t[vec[u][i].fi], id = vec[u][i].se;

                    ans[id] = bit.sum(R[x]) - bit.sum(L[x] - );

                }

            } else if(s[i] == 'B') {

                if(stk.size() > ) {

                    bit.modify(L[u], -);

                    stk.pop();

                    u = stk.top();

                }

            } else {

                int c = idx(s[i]);

                u = ch[u][c];

                stk.push(u);

                bit.modify(L[u], );

            }

        }

        for(int i = ; i <= n; i++) printf("%d\n", ans[i]);

    }

} ac();

int main() {

    ac.init(); pos = ;

    scanf("%s%d", s, &n);

    for(int i = ; i <= n; i++) {

        scanf("%d%d", &qus[i].x, &qus[i].y);

        qus[i].id = i;

    }

    sort(qus + , qus +  + n);

    ac.addStr(s);

    ac.build();

    ac.solve(s);

    return ;

}

/*

*/