#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int a[512000];

void initialize(char* s) {
    // This function is called once before all queries.
    for(int i=0;i<strlen(s);i++) {
        a[i+1]=(s[i]-'a');
    }
}
long long int factorial(int n) {
    if(n==0)
        return 1;
    long long int result=1;
  
    for(int i=1;i<=n;i++) {
        result=result*i;
    }
    return result;
}

int answerQuery(int l, int r) {
    int b[26];
    for(int i=0;i<26;i++) {
        b[i]=0;
    }
    for(int i=l;i<=r;i++) {
        b[a[i]]++;
    }
    int sum=0;
    //for(int i=0;i<26;i++) {
      //  printf("%c %d ",('a' + i),b[i]);
    //}
    int flag=0,maxlen=0;
    for(int i=0;i<26;i++) {
        if(!flag && (b[i]%2)) {
            flag=1;
            maxlen = b[i]/2+maxlen+1;
            continue;
        }
        maxlen = b[i]/2+maxlen;
    }
    long long int denominator=1;
    for(int i=0;i<26;i++) {
        denominator=denominator * factorial((b[i]/2));
       // printf("%d %lld ",i,denominator);
    }
    //printf("%lld %d\n",denominator, maxlen);
    return ((factorial(maxlen)/denominator) % 1000000007);
    // Return the answer for this query modulo 1000000007.
}

int main() {
    char* s = (char *)malloc(512000 * sizeof(char));
    scanf("%s", s);
    initialize(s);
    int q; 
    scanf("%i", &q);
    for(int a0 = 0; a0 < q; a0++){
        int l; 
        int r; 
        scanf("%i %i", &l, &r);
        int result = answerQuery(l, r);
        printf("%d\n", result);
    }
    return 0;
}