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.*;
 
public class Main2 {
	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; } 
    }
	static long mod = (long)(1e9+7);
//	static long mod = 998244353;
//	static Scanner sc = new Scanner(System.in);
	static FastReader sc = new FastReader();
	static PrintWriter out = new PrintWriter(System.out);
	static double dp[][][][];
	public static void main (String[] args) {
		int t = 1;
//    	t = sc.nextInt();
	    z : for(int tc=1;tc<=t;tc++) {
	    	char s[] = sc.next().toCharArray();
	    	int n = s.length;
	    	int dp[][] = new int[n][n];
	    	boolean check[][] = new boolean[n][n];
	    	for(int g=0;g<n;g++) {
	    		for(int i=0,j=g;j<n;j++,i++) {
	    			if(g == 0) {
	    				check[i][j] = true;
	    			}
	    			else {
	    				check[i][j] = (s[i] == s[j]);
	    				if(i+1<=j-1) check[i][j] &= check[i+1][j-1];
	    			}
	    		}
	    	}
	    	for(int g=0;g<n;g++) {
	    		for(int i=0,j=g;j<n;j++,i++) {
	    			if(g == 0) {
	    				dp[i][j] = 1;
	    			}
	    			else {
	    				dp[i][j] = dp[i+1][j] + dp[i][j-1] - dp[i+1][j-1];
	    				if(check[i][j]) dp[i][j]++;
	    			}
	    		}
	    	}
//	    	for(int i=0;i<n;i++) {
//	    		for(int j=0;j<n;j++) {
//	    			out.write(dp[i][j]+" ");
//	    		}
//	    		out.write("\n");
//	    	}
	    	int q = sc.nextInt();
	    	while(q-->0) {
	    		int l = sc.nextInt();
	    		int r = sc.nextInt();
	    		out.write(dp[l-1][r-1]+"\n");
	    	}
	    }
		out.close();
	}
	private static boolean is(char[] s, int i, int j) {
		while(i<j) {
			if(s[i]!=s[j]) return false;
			i++;
			j--;
		}
		return true;
	}
	private static void sort(int[] a) {List<Integer> k = new ArrayList<>();for(int val : a) k.add(val);Collections.sort(k);for(int i=0;i<a.length;i++) a[i] = k.get(i);}
	private static void ini(List<Integer>[] tre2){for(int i=0;i<tre2.length;i++){tre2[i] = new ArrayList<>();}}
	private static void sort(long[] a) {List<Long> k = new ArrayList<>();for(long val : a) k.add(val);Collections.sort(k);for(int i=0;i<a.length;i++) a[i] = k.get(i);}
}