You've got a string s = s1s2... s|s| of length |s|, consisting of lowercase English letters. There also are q queries, each query is described by two integers li, ri (1 ≤ li ≤ ri ≤ |s|). The answer to the query is the number of substrings of string s[li... ri], which are palindromes.

String s[l... r] = slsl + 1... sr (1 ≤ l ≤ r ≤ |s|) is a substring of string s = s1s2... s|s|.

String t is called a palindrome, if it reads the same from left to right and from right to left. Formally, if t = t1t2... t|t| = t|t|t|t| - 1... t1.

Input

The first line contains string s (1 ≤ |s| ≤ 5000). The second line contains a single integer q (1 ≤ q ≤ 106) — the number of queries. Next q lines contain the queries. The i-th of these lines contains two space-separated integers li, ri (1 ≤ li ≤ ri ≤ |s|) — the description of the i-th query.

It is guaranteed that the given string consists only of lowercase English letters.

Output

Print q integers — the answers to the queries. Print the answers in the order, in which the queries are given in the input. Separate the printed numbers by whitespaces.

Examples

Input

caaaba
5
1 1
1 4
2 3
4 6
4 5


Output

1
7
3
4
2

Note

Consider the fourth query in the first test case. String s[4... 6] = «aba». Its palindrome substrings are: «a», «b», «a», «aba».
import java.util.*;
import java.io.*;
public class testing {

    
    
    /************************ SOLUTION STARTS HERE ***********************/

    
    private static void solve() {
        String str = nextLine();
        int N = str.length();
        int prefixSum[][] = new int[N][N];  // indexed [left][right]
        for(int i=0;i<N;i++)
            prefixSum[i][i] = 1;
        for(int i=0;i<N-1;i++)
            if(str.charAt(i) == str.charAt(i + 1))
                prefixSum[i][i + 1] = 1;
        
        for(int len = 3;len <= N;len++) 
            for(int i=0;i<=N-len;i++)
                prefixSum[i][i + len - 1] = str.charAt(i) == str.charAt(i + len - 1) && prefixSum[i + 1][i + len - 2] == 1 ? 1 : 0;
        
        for(int i=0;i<N;i++)
            for(int j=i+1;j<N;j++)
                prefixSum[i][j] += prefixSum[i][j - 1];
        
        /*      
        for(int i=0;i<N;i++) {
            for(int j=0;j<N;j++)
                out.print(String.format("%4d ", prefixSum[i][j]));
            out.println();
        }
        */
        
        int cntPalin[][] = new int[N][N]; // indexed [right][left]
        
        for(int right=N-1;right>=0;right--) {
            cntPalin[right][right] = 1;
            for(int left=right - 1;left>=0;left--) 
                cntPalin[right][left] = cntPalin[right][left + 1]+ prefixSum[left][right];
        }
        /*
        for(int i=0;i<N;i++) {
            for(int j=0;j<N;j++)
                out.print(String.format("%4d ", cntPalin[j][i]));
            out.println();
        }
        */
        int Q = nextInt();
        while(Q-->0) {
            int L = nextInt();
            int R = nextInt();
            println(cntPalin[R - 1][L - 1]);
        }
    }

    
    /************************ SOLUTION ENDS HERE ************************/

    
    
    
    
    /************************ TEMPLATE STARTS HERE *********************/
    
    static BufferedReader reader;
    static PrintWriter    writer;
    static StringTokenizer st;

    public static void main(String[] args) throws IOException {
        InputStream inStream   = System.in; 
        OutputStream outStream = System.out;        
        reader = new BufferedReader(new InputStreamReader(inStream));
        writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outStream)), false);
        st     = null;
        solve();
        reader.close();
        writer.close();
    }
    
    static String next()
    {while(st == null || !st.hasMoreTokens()){try{String line = reader.readLine();if(line == null){return null;}            
    st = new StringTokenizer(line);}catch (Exception e){throw new RuntimeException();}}return st.nextToken();}
    static String nextLine()  {String s=null;try{s=reader.readLine();}catch(IOException e){e.printStackTrace();}return s;}             
    static int    nextInt()   {return Integer.parseInt(next());}
    static long   nextLong()  {return Long.parseLong(next());}     
    static double nextDouble(){return Double.parseDouble(next());}
    static char   nextChar()  {return next().charAt(0);}
    static int[]  nextIntArray(int n)         {int[] a= new int[n];   int i=0;while(i<n){a[i++]=nextInt();}  return a;}
    static long[] nextLongArray(int n)        {long[]a= new long[n];  int i=0;while(i<n){a[i++]=nextLong();} return a;}    
    static int[]  nextIntArrayOneBased(int n) {int[] a= new int[n+1]; int i=1;while(i<=n){a[i++]=nextInt();} return a;}            
    static long[] nextLongArrayOneBased(int n){long[]a= new long[n+1];int i=1;while(i<=n){a[i++]=nextLong();}return a;}            
    static void   print(Object o)  { writer.print(o);  }
    static void   println(Object o){ writer.println(o);}
    
    /************************ TEMPLATE ENDS HERE ************************/
}