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.
from sys import stdin
input=stdin.readline

s=input()
n=len(s)

pl=[[0]*n for _ in range(n+69)]
dp=[[0]*n for _ in range(n+420)]

for i in range(n):
	pl[i][i]=dp[i][i]=1
	pl[i+1][i]=1

for ln in range(2,n+1):
        for st in range(n-ln+1):
            j=st+ln-1
            if ln==0:pl[i][j]=1
            elif s[st]==s[j]:
                if ln == 1:pl[i][j] = 1
                else:pl[st][j] = pl[st + 1][j - 1]
            else:
                pl[st][j]=int(s[st]==s[j] and pl[st+1][j-1])

for ln in range(2,n+1):
	for st in range(n-ln+1):
		dp[st][st+ln-1]=dp[st][st+ln-2]+dp[st+1][st+ln-1]-dp[st+1][st+ln-2]+pl[st][st+ln-1]

for _ in range(int(input())):
	l,r=map(int,input().split())
	print(dp[l-1][r-1])