#include<bits/stdc++.h>
using namespace std;



int longestPalSubstr( char *news )
{
    int n = strlen( news ); 

    bool table[n][n];
    memset(table, 0, sizeof(table));

    int maxLength = 1;
    for (int i = 0; i < n; ++i)
        table[i][i] = true;
  int start = 0;
    for (int i = 0; i < n-1; ++i)
    {
        if (news[i] == news[i+1])
        {
            table[i][i+1] = true;
            start = i;
            maxLength = 2;
        }
    }

    for (int k = 3; k <= n; ++k)
    {
         for (int i = 0; i < n-k+1 ; ++i)
        {
            int j = i + k - 1;

            if (table[i+1][j-1] && news[i] == news[j])
            {
                table[i][j] = true;

                if (k > maxLength)
                {
                    start = i;
                    maxLength = k;
                }
            }
        }
    }




    return maxLength;
    maxLength=0 ;
}

int main()
{
    char str[100000] ;
    cin>>str ;
    int q ;
    cin>>q ;
    while(q--)
    {
        int l,r ;
        cin>>l>>r ;
        char news[100000] ;
        int k=0 ;
        for(int i=l-1;i<r;i++)
        {
            news[k]=str[i] ;
            k++ ;

        }
        int n = strlen(news);
       
            cout<<longestPalSubstr(news)-1<<endl ;
    }
}