#include<bits/stdc++.h>

#define ld long double
#define ll long long int
#define float long double
#define pb push_back
#define mk make_pair
#define mod 1000000007
#define ALL(a) a.begin(),a.end()
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define DEBUG(x) cout<<" x is "<<x<<"\n"
using namespace std;

//inline size_t key( int a,int b,int c,int d) {return a*b*c*d-7707;}
//unordered_map<size_t,bool >vismap;


/*int dx[] = {1,-1,0,0} , dy[] = {0,0,1,-1}; */  // 2 Direction
/*int dx[] = {1,0} , dy[] = {0,1};     */  // 4 Direction
/* int dx[] = {1,-1,0,0,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1,1,-1}; */ // 8 Direction
/* int dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] = {2,2,-2,-2,1,-1,1,-1}; */ // Knight Direction
/* int dx[] = {2,-2,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1}; */ // Hexagonal Direction

ll S,M,SM,MS,SMS;
string s;

const ll N=1000000+10;
const ll  sqN=320;
int ans[N];



struct query{
    ll l;
    ll r;
    ll idx;
} Q[N];


bool comp(query &q1,query &q2){
    if(q1.l/sqN !=q2.l/sqN){
        return q1.l <q2.l;
    }
    if((q1.l/sqN) &1){
        return q1.r <q2.r;
    }
    return q1.r>q2.r;
}


inline void addFront(ll i){
    if(s[i]=='s'){
        SMS+=MS;
        SM+=M;
        S++;
    }
    else if(s[i]=='m'){
        MS+=S;
        M++;
    }
}

inline void addRear(ll i){
    if(s[i]=='s'){
        SMS+=SM;
        S++;
        MS+=M;
    }

    else if(s[i]=='m'){
        SM+=S;
        M++;
    }
}

inline void remFront(ll i){
      if(s[i]=='s'){
        SMS-=MS;
        SM-=M;
        S--;
    }
    else if(s[i]=='m'){
        MS-=S;
        M--;
    }
}

inline void remRear(ll i){
    if(s[i]=='s'){
        SMS-=SM;
        S--;
        MS-=M;
    }
    else if(s[i]=='m'){
        SM-=S;
        M--;
    }
}



int main(){
    fast

   cin>>s;

    ll q,l,r;
    cin>>q;
    for(ll i=0;i<q;i++){
        cin>>l>>r;

        l--;r--;
        Q[i].l=l;
        Q[i].r=r;
        Q[i].idx=i;
    }

    sort(Q,Q+q,comp);

    l=0,r=-1;

    for(ll i=0;i<q;i++){

        ll L=Q[i].l;
        ll R=Q[i].r;
        if(L>R){
            ans[Q[i].idx]=0;
            continue;
        }
        while(l<L){
            remFront(l);
            l++;
        }

        while(l>L){
            l--;
            addFront(l);
        }

        while(r<R){
            r++;
            addRear(r);
        }

        while(r>R){
            remRear(r);
            r--;
        }

        ans[Q[i].idx]=SMS;

    }

    for(ll i=0;i<q;i++){
        cout<<ans[i]<<"\n";
    }



    return 0;
}