#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

/*void initialize(char* s) {
    // This function is called once before all queries.
}
*/
int ind(char a,char *p)
{
    int i=0;
    while(1)
    {
        if(a==p[i])
            break;
        i++;
    }
    return i;
}
int coun(char a,char* p)
{
    int cn=0,i=0;
    while(p[i]!='\0')
    {
        if(p[i]==a)
            cn++;
        i++;
    }
    return cn;
}
int answerQuery(int l, int r,char *s) {
    // Return the answer for this query modulo 1000000007.
    long cn=0;
    int re;
    int e=r-l,q=0;
    int a[e];
    for(int i=l;i<=r;i++)
    {
        if(ind(s[i],s)==i)
        {
            a[q]=coun(s[i],s);
            q++;
        }
    }
    if((r-l)%2==0)
    {
        int su=0;
        for(int i=0;i<q;i++)
        {
            if(a[i]%2==0)
                su++;
        }
        re=su;
    }
    else
    {
        int ev=0,od=0;
        for(int i=0;i<q;i++)
        {
            if(a[i]%2==0)
                ev++;
            else
            {
                if(od!=1)
                    od++;
            }
        }
        re=ev+od;
    }
    return re%10000000007;
    
}

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-1, r-1,s);
        printf("%d\n", result);
    }
    return 0;
}