def check(word):
    if word==word[::-1]:
            return True
    return False
def palindrome(string):
    left,right=0,len(string)
    j=right
    results=[]
    while left < right-1:
        temp = string[left:j]
        j-=1
        if check(temp):
            results.append(temp)
        if j<left+2:
            left+=1
            j=right
    return list(set(results))
st=raw_input()
q=input()
for day in range(q):
      l,r=raw_input().split(" ")
      l,r=int(l),int(r)
      s=st[l-1:r]
      array=palindrome(s)
      maxi=array[0]
      for rofl in array:
            if len(rofl)>len(maxi):
                  maxi=rofl
      maxlen=len(maxi)
      ans=0
      for rofl in array:
            if len(rofl)==maxlen:
                  ans+=1
      print ans