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

public final class QueriesForNumberOfPalindromes
{
    public static void main(String[] args)
    {
        new QueriesForNumberOfPalindromes(System.in, System.out);
    }

    private static class Solver implements Runnable
    {
        char[] s;
        int len, q;
        int[][] isPal;
        // BufferedReader in;
        InputReader in;
        PrintWriter out;

        void solve() throws IOException
        {
            s = in.nextLine().toCharArray();
            len = s.length;
            q = in.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);

/*            System.out.println("isPal :");

            for (int i = 0; i < len; i++, System.out.println())
                for (int j = 0; j < len; j++)
                    System.out.print(isPal[i][j] + " ");*/

            while (q-- > 0)
            {
                int x = in.nextInt() - 1;
                int y = in.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)
        {
//            System.out.println("i : " + i + ", j : " + 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);
        }

        // uncomment below line to change to BufferedReader
        // public Solver(BufferedReader in, PrintWriter out)
        Solver(InputReader in, PrintWriter out)
        {
            this.in = in;
            this.out = out;
        }

        @Override
        public void run()
        {
            try
            {
                solve();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
        }
    }

    private static class InputReader
    {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        int read()
        {
            if (numChars == -1)
                throw new InputMismatchException();

            if (curChar >= numChars)
            {
                curChar = 0;
                try
                {
                    numChars = stream.read(buf);
                }
                catch (IOException e)
                {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }

            return buf[curChar++];
        }

        int nextInt()
        {
            int c = read();

            while (isSpaceChar(c))
                c = read();

            int sgn = 1;

            if (c == '-')
            {
                sgn = -1;
                c = read();
            }

            int res = 0;

            do
            {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();

                res *= 10;
                res += c & 15;

                c = read();
            } while (!isSpaceChar(c));

            return res * sgn;
        }

        boolean isSpaceChar(int c)
        {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        String nextLine()
        {
            int c = read();

            StringBuilder result = new StringBuilder();

            do
            {
                result.appendCodePoint(c);

                c = read();
            } while (!isNewLine(c));

            return result.toString();
        }

        boolean isNewLine(int c)
        {
            return c == '\n';
        }

        void close()
        {
            try
            {
                stream.close();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
        }

        InputReader(InputStream stream)
        {
            this.stream = stream;
        }

    }

    private QueriesForNumberOfPalindromes(InputStream inputStream, OutputStream outputStream)
    {
        // uncomment below line to change to BufferedReader
        // BufferedReader in = new BufferedReader(new
        // InputStreamReader(inputStream));
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Thread thread = new Thread(null, new Solver(in, out), "Solver", 1 << 29);

        thread.start();
        try
        {
            thread.join();
        }
        catch (InterruptedException e)
        {
            e.printStackTrace();
        }

        in.close();
        out.flush();
        out.close();
    }

}
