#include<bits/stdc++.h>
#define MAXN 100010
using namespace std;
int tree[MAXN];
int prefR[MAXN],prefL[MAXN];
long long outp[MAXN];
void update(int ind, int val)
{
    for(;ind<=MAXN;ind+=(ind & -ind))tree[ind]+=val;
}
long long query(int ind)
{
    long long res=0;
    for(;ind>0;ind-=(ind & -ind))res+=tree[ind];
    return res;
}
int main()
{
    freopen("bros.in","r",stdin);
    string s;
    //ios_base::sync_with_stdio(false);
    //cin.tie(0);
    cin>>s;

    int n=s.size(),cntr=0;
    for(int i=0;i<n;i++)
    {
        if(s[i]=='R')
        {
            cntr++;
            prefR[i+1]=prefR[i]+1;
            prefL[i+1]=prefL[i];
        }
        else
        {
            update(i+1,cntr);
            prefR[i+1]=prefR[i];
            prefL[i+1]=prefL[i]+1;
        }
    }
    int q;
    cin>>q;
    for(int t=0;t<q;t++)
    {
        int l,r;
        cin>>l>>r;
        long long ans=query(r)-query(l-1);
        long long mult=(prefL[r]-prefL[l-1]);mult*=prefR[l-1];
        outp[t]=ans-mult;
    }
    fclose(stdin);
    freopen("bros.out","w",stdout);
    for(int t=0;t<q;t++)cout<<outp[t]<<"\n";
    fclose(stdout);
}
/*
RRLLRLL
3
4 7
1 4
3 4
*/