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

public class Solution {

    static void initialize(String s) {
        
    }

    static int answerQuery(int l, int r,String s) {
        // Return the answer for this query modulo 1000000007.
      s =s.substring(l-1,r);
        int i=0,j=0;
        //System.out.println(s);
        int n=s.length();
        //List<String>  h= new ArrayList<String>();
        HashMap<Character,Integer> hm= new HashMap<Character,Integer>();
        //h=printAllPalindromes(s);
        //System.out.println(h);
        
        for(i=0;i<n;i++)
        {
            if(hm.containsKey(s.charAt(i)) && hm.size()!=0)
            {
                int temp= hm.get(s.charAt(i));
                hm.put(s.charAt(i),++temp);
            }
            else
            {
                hm.put(s.charAt(i),1);
            }
            
            
        }
        //System.out.println(hm);
        int p=0;
        int q=0;
        for(int c: hm.values())
        {
            if(c==2)
                p++;
            if(c==1)
                q++;
        }
        
        if(q==0)
        return p+q;
        if(q!=0)
            return p+1;
        
        return 0;
        
    }
    
    public static List<String> printAllPalindromes(String input) {
   // if (input.length() <= 2) {
     //   return Collections.emptySet();
    //}
    List<String> out = new ArrayList<String>();
    int length = input.length();
    for (int i = 1; i <= length; i++) {
        for (int j = i - 1, k = i; j >= 0 && k < length; j--, k++) {
            if (input.charAt(j) == input.charAt(k)) {
                out.add(input.substring(j, k + 1));
            } else {
                break;
            }
        }
    }
    return out;
}
    
    public static void printAllPalindrome(String str) {
        
        
        for(int i=0;i<=str.length();i++)
            for(int j=i;j<str.length();j++)
                if(checkPalindrome(str.substring(i,j+1)))
                    System.out.println(str.substring(i,j+1));
    }
    
    public static boolean checkPalindrome(String str) {
        for(int i=0;i<=str.length()/2;i++)
            if(str.charAt(i)!=str.charAt(str.length()-1-i))
                return false;
        return true;
    }

    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,s);
            System.out.println(result);
        }
        in.close();
    }
}