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.*;
import java.util.*;


public class H {
	private static BufferedReader reader;  
	private static PrintWriter writer;
	private static StringTokenizer tokenizer;

	private static void println() {
		writer.println();
	}
	private static void print(String obj) {
		writer.print(obj);
	}
	
	private static void println(Object obj) {
		writer.println(obj);
	}
	
	private static void printf(String f, Object... obj) {
		writer.printf(f, obj);
	}

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

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

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

	private static String nextToken() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			tokenizer = new StringTokenizer(reader.readLine());
		}
		return tokenizer.nextToken();
	}
	public static void main(String[] args) throws IOException{
		begin();
		String s = nextToken();
		int n = s.length();
		int [][]dp = new int [n+1][n+1];
		boolean [][]pdm =  new boolean [n+1][n+1];  
		for (int i = 0; i < n; i++) {
			dp[i][i] = 1; 
			pdm[i][i] = true;
		}
		for (int i = 2; i <=n; i++) {
			for (int j = 0; j <=n-i; j++) {
				dp[j][j+i-1] = dp[j+1][j+i-1]+dp[j][j+i-2]-dp[j+1][i+j-2];
				if (s.charAt(j) == s.charAt(j+i-1)){
					if (pdm[j+1][j+i-2]){
						dp[j][j+i-1]++;
						pdm[j][j+i-1] = true;
					}
					if (i == 2){
						dp[j][j+i-1]++;
						pdm[j][j+i-1] = true;
					}
				}
			}
		}
		int m = nextInt(),L,R;
		for (int i = 0; i < m; i++) {
			L = nextInt()-1;
			R = nextInt()-1;
			println(dp[L][R]);
		}
		end();
	}
	private static void end() {
		writer.close();
	}
	private static void begin() throws IOException{
		reader = new BufferedReader(new InputStreamReader(System.in));
		writer = new PrintWriter(new OutputStreamWriter(System.out));
	}

}
