You've got a string *s* = *s*<sub class="lower-index">1</sub>*s*<sub class="lower-index">2</sub>... *s*<sub class="lower-index">|*s*|</sub> of length |*s*|, consisting of lowercase English letters. There also are *q* queries, each query is described by two integers *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> (1 ≤ *l*<sub class="lower-index">*i*</sub> ≤ *r*<sub class="lower-index">*i*</sub> ≤ |*s*|). The answer to the query is the number of substrings of string *s*[*l*<sub class="lower-index">*i*</sub>... *r*<sub class="lower-index">*i*</sub>], which are palindromes.

String *s*[*l*... *r*] = *s*<sub class="lower-index">*l*</sub>*s*<sub class="lower-index">*l* + 1</sub>... *s*<sub class="lower-index">*r*</sub> (1 ≤ *l* ≤ *r* ≤ |*s*|) is a substring of string *s* = *s*<sub class="lower-index">1</sub>*s*<sub class="lower-index">2</sub>... *s*<sub class="lower-index">|*s*|</sub>.

String *t* is called a palindrome, if it reads the same from left to right and from right to left. Formally, if *t* = *t*<sub class="lower-index">1</sub>*t*<sub class="lower-index">2</sub>... *t*<sub class="lower-index">|*t*|</sub> = *t*<sub class="lower-index">|*t*|</sub>*t*<sub class="lower-index">|*t*| - 1</sub>... *t*<sub class="lower-index">1</sub>.
The first line contains string *s* (1 ≤ |*s*| ≤ 5000). The second line contains a single integer *q* (1 ≤ *q* ≤ 10<sup class="upper-index">6</sup>) — the number of queries. Next *q* lines contain the queries. The *i*-th of these lines contains two space-separated integers *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> (1 ≤ *l*<sub class="lower-index">*i*</sub> ≤ *r*<sub class="lower-index">*i*</sub> ≤ |*s*|) — the description of the *i*-th query.

It is guaranteed that the given string consists only of lowercase English letters.
s = input().strip()

q = [[0] * len(s) for _ in range(len(s))]

p = [[None] * len(s) for _ in range(len(s))]

for i in range(len(s)):
	q[i][i] = 1
	p[i][i] = True

for i in range(len(s) - 1):
	if s[i] == s[i + 1]:
		q[i][i + 1] = 3
		p[i][i + 1] = True
	else:
		q[i][i + 1] = 2
		p[i][i + 1] = False

for a in range(2, len(s)):
	for i in range(len(s) - a):
		if p[i + 1][i + a - 1] and s[i] == s[i + a]:
			p[i][i + a] = True
			q[i][i + a] = q[i][i + a - 1] + q[i + 1][i + a] - q[i + 1][i + a - 1] + 1
		else:
			p[i][i + a] = False
			q[i][i + a] = q[i][i + a - 1] + q[i + 1][i + a] - q[i + 1][i + a - 1]

for _ in range(int(input())):
	a, b = map(int, input().split())
	print(q[a - 1][b - 1])
	     	 	 	   	 			  	  		 	