#include <bits/stdc++.h>

using namespace std;

string initialize(string s0,int l, int r) {
  string s; int j=0;
   s = s0.substr (l-1,(r-l+1));// This function is called once before all queries.
  cout<<s<<"yoyo";
 return s;}



long int longestPalSubstr(string p)
{
    long int  n = p.length(); // get length of input string

    // table[i][j] will be false if substring str[i..j]
    // is not palindrome.
    // Else table[i][j] will be true
    bool table[n][n];
    memset(table, 0, sizeof(table));

    // All substrings of length 1 are palindromes
  int maxLength = 1;
  /*    for (int i = 0; i < n; ++i)
        table[i][i] = true; */

    // check for sub-string of length 2.
    int start = 0;
    for (int i = 0; i < n-1; ++i)
    {
        if (p[i] == p[i+1])
        {
            table[i][i+1] = true;
            start = i;
            maxLength = 2;
        }
    }

    // Check for lengths greater than 2. k is length
    // of substring
    for (int k = 3; k <= n; ++k)
    {
        // Fix the starting index
        for (int i = 0; i < n-k+1 ; ++i)
        {
            // Get the ending index of substring from
            // starting index i and length k
            int j = i + k - 1;

            // checking for sub-string from ith index to
            // jth index iff str[i+1] to str[j-1] is a
            // palindrome
            if (table[i+1][j-1] && p[i] == p[j])
            {
                table[i][j] = true;

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

  //  printf("Longest palindrome substring is: ");
  //  printSubStr( str, start, start + maxLength - 1 );

    return ((maxLength)); // return length of LPS
}

// Driver program to test above functions






int main() {
    string s0;
    cin >> s0;
   long int result;
    int q;
    cin >> q;
    for(int a0 = 0; a0 < q; a0++){
        int l;
        int r;
        cin >> l >> r;
       string p= initialize(s0,l,r);
         result = longestPalSubstr(p);
        
        cout << result << endl;
    }
    return 0;
}