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

public class Solution {
    public static ArrayList<String> permutation(String s) {
        // The result
        ArrayList<String> res = new ArrayList<String>();
        // If input string's length is 1, return {s}
        if (s.length() == 1) {
            res.add(s);
        } else if (s.length() > 1) {
            int lastIndex = s.length() - 1;
            // Find out the last character
            String last = s.substring(lastIndex);
            // Rest of the string
            String rest = s.substring(0, lastIndex);
            // Perform permutation on the rest string and
            // merge with the last character
            res = merge(permutation(rest), last);
        }
        return res;
    }

    public static ArrayList<String> merge(ArrayList<String> list, String c) {
        ArrayList<String> res = new ArrayList<String>();
        for (String s : list) {
            for (int i = 0; i <= s.length(); ++i) {
                String ps = new StringBuffer(s).insert(i, c).toString();
                res.add(ps);
            }
        }
        return res;
    }
    
    private static int subPal(String str) {
        String s1 = "";
        int maxLength = -1;
        int N = str.length(), count = 0;
        List<String> permutatedStrings = permutation(str);
        Set<String> palindromeArray = new HashSet<String>();
        for(String permutatedString: permutatedStrings){
            for (int i = 2; i <= N; i++) {
                for (int j = 0; j <= N; j++) {
                    int k = i + j - 1;
                    if (k >= N)
                        continue;
                    s1 = permutatedString.substring(j, i + j);
                    if (s1.length()>0 && s1.equals(new StringBuilder(s1).reverse().toString())) {
                        palindromeArray.add(s1);
                        if(maxLength<s1.length()){
                            maxLength = s1.length();
                        }
                    }
                }

            }
        }
        //System.out.println(palindromeArray);
        /*for (String s : palindromeArray)
            System.out.println(s + " - is a palindrome string.");
        System.out.println("The no.of substring that are palindrome : "
                + palindromeArray.size());*/
        int result = 0;
        for(String temp : palindromeArray){
            if(maxLength == temp.length()){
                result++;
            }
        }
        return result;
    }
    
    static int answerQuery(int l, int r, String s) {
        // Return the answer for this query modulo 1000000007.
        String subString = s.substring(l-1, r);
        return subPal(subString)%1000000007;
    }

    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();
    }
}