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

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

    static class HQueriesForNumberOfPalindromes {
        static char[] arr;
        static long[][] dp;
        static boolean[][] pal;

        public void solve(int testNumber, InputReader in, OutputWriter out) {
            arr = in.next().toCharArray();

            dp = new long[arr.length + 1][arr.length + 1];
            pal = new boolean[arr.length + 1][arr.length + 1];
            for (long[] row : dp) Arrays.fill(row, -1);
            ans(0, arr.length - 1);
            int q = in.nextInt();
            for (int i = 0; i < q; i++) {
                out.println(dp[in.nextInt() - 1][in.nextInt() - 1]);
            }
        }

        static long ans(int st, int end) {
            if (st == end) {
                pal[st][end] = true;
                return dp[st][end] = 1;
            }
            if (st > end) {
                pal[st][end] = true;
                return dp[st][end] = 0;
            }
            if (dp[st][end] != -1) return dp[st][end];
            long ans1 = ans(st + 1, end);
            long ans2 = ans(st, end - 1);
            long ans3 = ans(st + 1, end - 1);
            long ans = ans1 + ans2 - ans3;

            if (arr[st] == arr[end] && pal[st + 1][end - 1]) {
                ans++;
                pal[st][end] = true;
            }
            return dp[st][end] = ans;
        }

    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void close() {
            writer.close();
        }

        public void println(long i) {
            writer.println(i);
        }

    }
}

