#include<bits/stdc++.h>
using namespace std;
/*int sum(int n)
{
    int s=0;
    while(n)
    {
        s+=n%10;n/=10;
    }if(s<=9)return s;
    else return sum(s);
}*/
void palindromeSubStrs(string s)
{
    map<string, int> m;
    int n = s.size();

    // table for storing results (2 rows for odd-
    // and even-length palindromes
    int R[2][n+1];

    // Find all sub-string palindromes from the given input
    // string insert 'guards' to iterate easily over s
    s = "@" + s + "#";

    for (int j = 0; j <= 1; j++)
    {
        int rp = 0;   // length of 'palindrome radius'
        R[j][0] = 0;

        int i = 1;
        while (i <= n)
        {
            //  Attempt to expand palindrome centered at i
            while (s[i - rp - 1] == s[i + j + rp])
                rp++;  // Incrementing the length of palindromic
                       // radius as and when we find vaid palindrome

            // Assigning the found palindromic length to odd/even
            // length array
            R[j][i] = rp;
            int k = 1;
            while ((R[j][i - k] != rp - k) && (k < rp))
            {
                R[j][i + k] = min(R[j][i - k],rp - k);
                k++;
            }
            rp = max(rp - k,0);
            i += k;
        }
    }

    // remove 'guards'
    s = s.substr(1, n);

    // Put all obtained palindromes in a hash map to
    // find only distinct palindromess
    m[string(1, s[0])]=1;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j <= 1; j++)
            for (int rp = R[j][i]; rp > 0; rp--)
               m[s.substr(i - rp - 1, 2 * rp + j)]=1;
        m[string(1, s[i])]=1;
    }

    //printing all distinct palindromes from hash map
  /* cout << "Below are " << m.size()-1
        << " palindrome sub-strings";*/
        int cnt=0,siz=0;string ss;
   map<string, int>::iterator ii;
   for (ii = m.begin(); ii!=m.end(); ++ii)
     {
//if((*ii).first).size()>siz)siz=(*ii).first).size();
ss= (*ii).first;if(ss.length()>siz)siz=ss.length();
     } //cout << (*ii).first << endl;
      for (ii = m.begin(); ii!=m.end(); ++ii)
      {
          ss= (*ii).first;
          if(ss.length()==siz)cnt++;
      }cout<<cnt<<endl;
}
int main()
{
   string s;cin>>s;
   int q;cin>>q;
   while(q--)
   {
       int l,r;cin>>l>>r;
       string st;
       for(int i=l;i<=r;i++)st+=s[i];
       palindromeSubStrs(st);
   }
}