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

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

class TaskH {
	public void solve(int testNumber, StreamInputReader in, PrintWriter out) {
        String s = in.nextString();
        int N = s.length();

        /*int Q = in.nextInt();
        ArrayList<Pair>[] queries = new ArrayList[N + 1];
        for(int i = 1; i <= N; i++)
            queries[i] = new ArrayList<Pair>();
        for(int i = 0; i < Q; i++) {
            int left = in.nextInt() - 1;
            int right = in.nextInt() - 1;
            queries[right - left].add(new Pair(left, i));
        }*/

        int[][] numPal = new int[N + 1][N + 1];
        for(int i = 0; i < N; i++)
            numPal[i][i] = 1;
        for(int i = 0; i < N; i++) {
            // centered
            for(int j = 1; i - j >= 0 && i + j < N; j++)
                if(s.charAt(i - j) == s.charAt(i + j))
                    numPal[i - j][i + j] = 1;
                else break;

            // not centered
            if(i < N - 1 && s.charAt(i) == s.charAt(i + 1)) {
                numPal[i][i + 1] = 1;
                for(int j = 1; i - j >= 0 && i + 1 + j < N; j++)
                    if(s.charAt(i - j) == s.charAt(i + j + 1))
                        numPal[i - j][i + j + 1] = 1;
                    else break;
            }
        }

        for(int len = 2; len <= N; len++)
            for(int i = 0; i < N - len + 1; i++) {
                int j = i + len - 1;
                numPal[i][j] = numPal[i][j] + numPal[i + 1][j] + numPal[i][j - 1] - numPal[i + 1][j - 1];
            }

        int Q = in.nextInt();
        int left = -1;
        int right = -1;
        for(int i = 0; i < Q; i++) {
            left = in.nextInt() - 1;
            right = in.nextInt() - 1;
            out.println(numPal[left][right]);
        }

	}

   /* private class Pair {
        public int left;
        public int idx;

        private Pair(int left, int idx) {
            this.left = left;
            this.idx = idx;
        }
    }*/
}

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

    public StreamInputReader(InputStream stream) {
        this.stream = stream;
    }

    public 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++];
    }

    }

abstract class InputReader {

    public abstract int read();

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

    public String nextString() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        StringBuffer res = new StringBuffer();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));
        return res.toString();
    }

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

    }

