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.io.*;
import java.util.*;

public class Abc {
    static char s[];
    static int dp[][];
    public static void main(String[] args) throws IOException {
        FastReader sc = new FastReader();
        s=sc.next().toCharArray();
        dp=new int[s.length][s.length+1];
        for (int arr[]:dp)Arrays.fill(arr,-1);
        int ans[][]=new int[s.length][s.length+1];
        for (int i=1;i<=s.length;i++){
            for (int j=0;j<s.length;j++){
                ans[j][i]=dp(j,i);
                if (j<s.length && i-1<s.length+1)ans[j][i]+=ans[j][i-1];
                if (j+1<s.length && i-1<s.length+1)ans[j][i]+=ans[j+1][i-1];
                if (i-2>=0 && j+1<s.length)ans[j][i]+=-ans[j+1][i-2];

            }
        }
//        System.out.println(ans[4-1][4-1]+" "+ans[5-1][5-1]+" "+ans[6-1][6-1]);
        int q=sc.nextInt();
        StringBuilder sb=new StringBuilder();
        while (q-->0){
            int l=sc.nextInt()-1,r=sc.nextInt()-1;
            sb.append(ans[l][r-l+1]+"\n");
        }
        System.out.print(sb);
    }
    static int dp(int i,int l){
        if (i+l-1>=s.length)return 0;
        if (l==0 || l==1)return 1;
        if (dp[i][l]!=-1)return dp[i][l];
        return dp[i][l]=dp(i+1,l-2)==1 && s[i]==s[i+l-1]?1:0;
    }
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}