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.util.*;
import java.io.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Main {
   

   public static final int maxn = 5000 + 5;
   
   static boolean[][] isPalindrome;
   static int[][] dp;
   static String string;
   
   static BufferedReader in;
   static StringTokenizer st;
   static PrintWriter out;

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

   static  String nextString() throws IOException
   {
   		return in.readLine();
   }

   public static void main(String args[]) throws IOException
   {	
   		in = new BufferedReader(new InputStreamReader(System.in));
   		out = new PrintWriter(new OutputStreamWriter(System.out));
      
   		dp = new int[maxn][maxn];
   		isPalindrome = new boolean[maxn][maxn];

   		string = nextString();
   		findAllPalindomes();
   		calcDp();

   		int q = nextInt();

   		for (int i = 0; i < q; i++){
   			int l, r;
   				l = nextInt() - 1;
   				r = nextInt() - 1;
   			out.println(dp[l][r]);
   		}
   		out.flush();
   }

   static String nextToken() throws IOException
   {
   		while (st == null || !st.hasMoreTokens()) {
   			st = new StringTokenizer(in.readLine());
   		}
   		return st.nextToken();
   }
   static void findAllPalindomes()
   {
   		for (int length = 1; length <= string.length(); length++){
   			for (int l = 0; l < string.length(); l++){
   				int r = l + length - 1;
   				if (r >= string.length())
   					continue;
   				isPalindrome[l][r] = (string.charAt(l) == 
   					string.charAt(r)) && ( (l + 1 > r - 1) || isPalindrome[l + 1][r - 1]);
   			}
   		}
   }

   static void calcDp() {
   		 for (int length = 1; length <= string.length(); length++){
   		 	for (int l = 0; l < string.length(); l++){
   		 		int r = l + length - 1;
   		 		if (r >= string.length())
   		 			continue;
   		 		if (l == r){
   		 			dp[l][r] = 1;
   		 			continue;
   		 		}

   		 		if (l + 1 == r){
   		 			dp[l][r] = bToInt(isPalindrome[l][r]) + 2;
   		 			continue;
   		 		}

   		 		dp[l][r] = dp[l + 1][r] + dp[l][r - 1] - dp[l + 1][r - 1] + bToInt(
   		 			isPalindrome[l][r]);
   		 	}
   		 }
   }

   static int bToInt(boolean bool)
   {
   		return bool ? 1 : 0;
   }

}
