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».
//package contest;

import java.io.*;

public class ProblemH {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

    BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));

    int[] readInts() throws IOException {
        String[] strings = reader.readLine().split(" ");
        int[] ints = new int[strings.length];
        for(int i = 0; i < ints.length; i++) {
            ints[i] = Integer.parseInt(strings[i]);
        }
        return ints;
    }

    void solve() throws IOException {
        String s = reader.readLine();
        int n = s.length();
        byte[][] dp = new byte[4][n + 1];
        for(int i = 0; i < n; i++) {
            dp[0][i] = dp[1][i] = 1;
        }
//        for(int len = 2; len <= n; len++) {
//            for(int i = 0; i + len <= n; i++) {
//
//                if(dp[i + 1][i + len - 1] == 1 && s.charAt(i) == s.charAt(i + len - 1)) {
//                    dp[i][i + len] = 1;
//                }
//            }
//        }
        int[][] calc = new int[n + 1][n + 1];
        for(int i = 0; i < n; i++) {
            calc[i][i + 1] = 1;
        }
        for(int len = 2; len <= n; len++) {
            for(int i = 0; i + len <= n; i++) {
                if(dp[len - 2 & 3][i + 1] == 1 && s.charAt(i) == s.charAt(i + len - 1)) {
                    dp[len & 3][i] = 1;
                }
                else {
                    dp[len & 3][i] = 0;
                }
            }
            for(int i = 0; i + len <= n; i++) {

                int j = i + len;
                calc[i][j] = calc[i + 1][j] + calc[i][j - 1] - calc[i + 1][j - 1];
                calc[i][j] += dp[len & 3][i];
            }
        }
        int m = readInts()[0];
        for(int i = 0; i < m; i++) {
            int[] a = readInts();
            int l = a[0];
            int r = a[1];
            writer.write("" + calc[l - 1][r] + "\n");
        }
        writer.flush();
    }

    public static void main(String[] args) throws IOException {
        new ProblemH().solve();
    }
}
