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.util.StringTokenizer; 
import java.io.PrintWriter;
public class T_245H {
	private static void solve() {
		FastReader in = new FastReader();
		PrintWriter writerObj = new PrintWriter(System.out);
		char[] s = in.nextLine().toCharArray();
		int[][] dpMaxCount = preprocess(s);
		int q = in.nextInt();
		for (int r = 0 ; r < q; r++) {
			int i = in.nextInt() - 1;
			int j = in.nextInt() - 1;
			writerObj.println(dpMaxCount[i][j]);
		}
		writerObj.flush();
		writerObj.close();
	}
	
	private static int[][] preprocess(char[] s){
		int n = s.length;
		int[][] dpMaxLen = new int[n][n];
		int[][] dpMaxCount = new int[n][n];
		for (int i = 0; i < n; i++) {
			dpMaxLen[i][i] = 1;
			dpMaxCount[i][i] = 1;
		}

		for (int len = 1; len < n; len++) {
			for (int i = 0; i + len < n; i++) {
				int j = i + len;
				//fill maxLength
				if (s[i] == s[j]) {
					if (dpMaxLen[i + 1][j - 1] == j - 1 - i - 1 + 1) {
						dpMaxLen[i][j] = dpMaxLen[i + 1][j - 1] + 2;
					} else {
						dpMaxLen[i][j] = Math.max(dpMaxLen[i][j - 1], dpMaxLen[i + 1][j]);
					}
				} else {
					dpMaxLen[i][j] = Math.max(dpMaxLen[i][j - 1], dpMaxLen[i + 1][j]);
				}
				
				//fill maxCount
				dpMaxCount[i][j] = dpMaxCount[i][j - 1] + dpMaxCount[i + 1][j] - dpMaxCount[i + 1][j - 1];
				if (s[i] == s[j] && dpMaxLen[i + 1][j - 1] == j - 1 - i - 1 + 1) {
					dpMaxCount[i][j] += 1;
				}
				
			}
		}
		return dpMaxCount;
	}
	public static void main(String[] args) {
		solve();
	}
	
    static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 
}
