#include <iostream>
#include <string>
#include <map>
#include <algorithm>
using namespace std;

int fib(int n){
    if (n==0 || n==1)
        return 1;
    return n*fib(n-1);
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    string word;
    int t;
    cin >> word;
    cin >> t;
    for(int i=0; i<t; i++){
        int l,r;
        map<char, int>ma;
        cin >> l;
        cin >> r;
        for(int j=l-l;j<r; j++){
            if(ma.find(word[j])!=ma.end())
                ma[word[j]]++;
            else
                ma[word[j]] = 1;
        }
        map<char, int>::iterator it;
        int s_count =0;
        int d_count =0;
        for(it=ma.begin(); it!=ma.end(); it++){
            if(it->second%2==0){
                d_count = d_count + it->second/2;
            } else{
                d_count = d_count + it->second/2;
                s_count = s_count +1;
            }
        }
        if(s_count ==0){
            cout << fib(d_count)<<endl;
        } else{
            cout << fib(d_count)*s_count<<endl;
        }

    }
    
    return 0;
}