#include <bits/stdc++.h>
#define m 1000000007
using namespace std;
char rev[1000000];
char s[1000000];

int answerQuery(int l, int r) {
    // Return the answer for this query modulo 1000000007.
    strcpy(rev,s);
    sort (rev+l-1,rev+r-1);
    int count=0;
    long long int no=0;
    //cout<<rev<<endl;
    for(int i =l-1;i<=r-2;++i)
    {
        
        if(rev[i]==rev[i+1])
        {count++ ;i++;}
        
        if(rev[i]!=rev[i+1]&&count>0)
            no++;
        no=no%m;
    }
    return no%m;
}

int main() {
    
    cin >> s;
    int q;
    cin >> q;
    for(int a0 = 0; a0 < q; a0++){
        int l;
        int r;
        cin >> l >> r;
        int result = answerQuery(l, r);
        cout << result << endl;
    }
    return 0;
}