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;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Task245h {
    StringTokenizer st;
    BufferedReader in;
    PrintWriter out;

    public static void main(String[] args) throws IOException {
        Task245h task = new Task245h();
        task.open();
        task.solve();
        task.close();
    }

    private void close() {
        out.flush();
        out.close();
    }
    char[] s;
    int len, q;
    int[][] isPal;
    private void solve() throws IOException {
        s = nextToken().toCharArray();
        len = s.length;
        q = nextInt();
        isPal = new int[len][len];

        for (int i = 0; i < len; i++)
            Arrays.fill(isPal[i], -1);

        for (int i = 0; i < len; i++)
            isPal[i][i] = 1;

        for (int i = 0; i < len; i++)
            for (int j = i + 1; j < len; j++)
                check(i, j);

        for (int i = 0; i < len; i++)
            for (int j = 0; j < len; j++)
                if (isPal[i][j] < 0)
                    isPal[i][j] = 0;

        for (int i = 0; i < len; i++)
            for (int j = i + 1; j < len; j++)
                isPal[i][j] += isPal[i][j - 1];

        for (int i = 0; i < len; i++)
            pushUp(len - 1, i, 0);


        while (q-- > 0) {
            int x = nextInt() - 1;
            int y = nextInt() - 1;

            out.println(isPal[x][y]);


        }
    }

    void pushUp(int row, int col, int add)
    {
        if (row == -1)
            return;

        isPal[row][col] += add;
        pushUp(row - 1, col, isPal[row][col]);
    }

    int check(int i, int j)
    {

        if (i >= j)
            return 1;

        if (isPal[i][j] != -1)
            return isPal[i][j];

        if (s[i] != s[j])
            return isPal[i][j] = 0;

        return isPal[i][j] = check(i + 1, j - 1);
    }



    private void open() {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
    }

    private String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String line = in.readLine();
            if (line == null) return null;
            st = new StringTokenizer(line);
        }
        return st.nextToken();
    }

    private int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    private double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    private long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
}

