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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Washoum
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        inputClass in = new inputClass(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        HQueriesForNumberOfPalindromes solver = new HQueriesForNumberOfPalindromes();
        solver.solve(1, in, out);
        out.close();
    }

    static class HQueriesForNumberOfPalindromes {
        public void solve(int testNumber, inputClass sc, PrintWriter out) {
            String s = sc.nextLine();
            int n = s.length();
            long[][] dp = new long[n][n];
            for (int i = 0; i < n; i++) {
                dp[i][i] = 1;
            }
            boolean[][] palin = new boolean[n][n];
            for (int i = 0; i < n; i++) {
                palin[i][i] = true;
            }
            for (int i = 2; i <= n; i++) {
                for (int j = 0; j + i - 1 < n; j++) {
                    if (s.charAt(j) == s.charAt(j + i - 1)) {
                        if (i == 2) {
                            palin[j][j + i - 1] = true;
                        } else if (palin[j + 1][j + i - 2]) {
                            palin[j][j + i - 1] = true;
                        }
                    }
                }
            }
            for (int i = 2; i <= n; i++) {
                for (int j = 0; j + i - 1 < n; j++) {
                    if (s.charAt(j) == s.charAt(j + i - 1)) {
                        if (i > 2 && palin[j + 1][j + i - 2]) {
                            dp[j][j + i - 1] = 1;
                        } else if (i == 2) {
                            dp[j][j + i - 1] = 1;
                        }

                    }
                    dp[j][j + i - 1] += dp[j + 1][j + i - 1];
                    dp[j][j + i - 1] += dp[j][j + i - 2];
                    if (i > 2) {
                        dp[j][j + i - 1] -= dp[j + 1][j + i - 2];
                    }
                }
            }
            int q = sc.nextInt();
            for (int i = 0; i < q; i++) {
                int x = sc.nextInt() - 1;
                int y = sc.nextInt() - 1;
                out.println(dp[x][y]);
            }
        }

    }

    static class inputClass {
        BufferedReader br;
        StringTokenizer st;

        public inputClass(InputStream in) {

            br = new BufferedReader(new InputStreamReader(in));
        }

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

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

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

    }
}

