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.
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
c {c} 1
ca {c, a} 2
caa {c, a, a, aa}  4
caaa {c, a, a, a, aa, aa} 6
caaab {c, a, a, a, aa, aa, b} 7
caaaba {c, a, a, a, b, a, aa, aa, aaa, aba} 10

c 1
c, a 2
c, a, a, aa 4
c, a, a, a, aa, aa, aaa  7

c, a, a, a, b, aa, aa, aaa 8

c, a, a, a, b, a, aa, aa, aaa, aba 10
"""



class PalindromeSolver:
    def __init__(self, s):
        self.prefix_dp = [1] * len(s)

        def _get_prefix_dp():
            n = len(s)
            
            dp = [[False] * n for _ in range(n)]
            for i in range(n):
                dp[i][i] = True
                
            for i in range(1, n):
                for j in range(i - 1, -1, -1):
                    if s[i] == s[j] and i - j <= 2:
                        dp[i][j] = True
                    elif s[i] == s[j]:
                        dp[i][j] = dp[i - 1][j - 1]
                    if dp[i][j]:
                        self.prefix_dp[i] += 1
                self.prefix_dp[i] += self.prefix_dp[i - 1]
                
        _get_prefix_dp()
        self.prefix_dp = [0] + self.prefix_dp
        
        
    def query(self, i, j):
        return self.prefix_dp[j] - self.prefix_dp[i] + 1
        

s = input()
palindromeSolver = PalindromeSolver(s)
n = int(input())
for _ in range(n):
    i, j = map(int, input().split())
    print(palindromeSolver.query(i, j))
            
