import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
static String hh="";
static HashSet<String>hs;
    static void initialize(String s) {
        hh=s;
        hs=new HashSet<>();
    }

    static int answerQuery(int l, int r) {
        hh=hh.substring(l,r);
        // Return the answer for this query modulo 1000000007.
        liststr(hh,0);
        int mx=0;
        int c=0;
        for(String nw:hs)
        {
            if(nw.length()==mx)
            {
                if(oddpal(nw)||evenpal(nw))
                {
                    c++;
                }
            }
            else if(nw.length()>mx)
            {
                mx=nw.length();
                c=1;
            }
        }
        return c;
    }
    static void liststr(String kk, int i)
    {
        if(i==kk.length())
        {
            hs.add(kk);
        }
        else
        {
            liststr(kk,i+1);
            liststr(kk.substring(0,i)+kk.substring(i+1,kk.length()),i);
        }
    }
    
    static boolean oddpal(String tm)
    {
        int c[]=new int[26];
        for(int i=0;i<tm.length();i++)
        {
            c[tm.charAt(i)-'a']++;
        }
        boolean pp=true;
        boolean one=false;
        for(int i=0;i<26;i++)
        {
           if((c[i]%2)!=0)
           {
               if(!one)
               {
                   one=true;  
               }
               else
               {
                   pp=false;
                   break;
               }
           }
        }
        return pp;
    }
    static boolean evenpal(String tm)
    {
        
        int c[]=new int[26];
        for(int i=0;i<tm.length();i++)
        {
            c[tm.charAt(i)-'a']++;
        }
        boolean pp=true;
        for(int i=0;i<26;i++)
        {
           if((c[i]%2)!=0)
           {
               pp=false;
               break;
           }
        }
        return pp;
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s = in.next();
        initialize(s);
        int q = in.nextInt();
        for(int a0 = 0; a0 < q; a0++){
            int l = in.nextInt();
            int r = in.nextInt();
            int result = answerQuery(l, r);
            System.out.println(result);
        }
        in.close();
    }
}