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.
string = input()
n = len(string)
string = "#"+string
dp = [[0 for i in range(len(string)+10)]for j in range(len(string)+10)]
isp = [[0 for i in range(len(string)+10)]for j in range(len(string)+10)]

def cp():
    
    for i in range(n,0,-1):
        for j in range(i,n+1):
            if i == j:
                isp[i][j] = 1
                continue
            if i+1 == j:
                isp[i][j] = (1 if string[i] == string[j] else 0)
                continue
            if string[i] == string[j]:
                isp[i][j] = isp[i+1][j-1]
            
def calc():
    for i in range(n,0,-1):
        for j in range(i,n+1):
            if i == j:
                dp[i][j] = 1
                continue 
            if i+1 == j:
                dp[i][j] =(3 if string[i] == string[j] else 2)
                continue
            dp[i][j] = dp[i][j-1]+dp[i+1][j]-dp[i+1][j-1]
            dp[i][j]+=isp[i][j]
cp()

calc()
t  = int(input())
for _ in range(t):
    a,b = map(int,input().split())
    print(dp[a][b])
    