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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class H {
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        String s = in.readLine();
        int n = s.length();
        int[][] A = new int[n + 1][n + 1];
        for (int i = 1; i <= n; i++) {
            A[i][i] = 1;
            if (i < n && s.charAt(i - 1) == s.charAt(i))
                A[i][i + 1] = 1;
        }
        for (int l = 3; l <= n; l++)
            for (int i = 1; i + l <= n + 1; i++)
                A[i][i + l - 1] = A[i + 1][i + l - 2]
                        & ((s.charAt(i - 1) == s.charAt(i + l - 2)) ? 1 : 0);
        for (int i = 1; i <= n; i++)
            for (int j = i; j <= n; j++)
                A[i][j] += A[i][j - 1];
        for (int i = n; i > 0; i--)
            for (int j = 1; j <= n; j++) {
                if (i < n)
                    A[i][j] += A[i + 1][j];
            }
        int q = Integer.parseInt(in.readLine());
        while (q-- > 0) {
            String[] Ss = in.readLine().split(" ");
            int x = Integer.parseInt(Ss[0]);
            int y = Integer.parseInt(Ss[1]);
            System.out.println(A[x][y]);
        }
    }
}
