// C++ program to find palindromic substrings of a string
#include<bits/stdc++.h>
#include<string>
using namespace std;

// Returna total number of palindrome substring of
// length greater then equal to 2
int CountPS(string str, int n)
{

    int dp[n][n];
    memset(dp, 0, sizeof(dp));

    // P[i][j] = true if substring str[i..j] is palindrome,
    // else false
    bool P[n][n];
    memset(P, false , sizeof(P));

    // palindrome of single lenght
    for (int i= 0; i< n; i++)
        P[i][i] = true;

    // palindrome of length 2
    for (int i=0; i<n-1; i++)
    {
        if (str[i] == str[i+1])
        {
            P[i][i+1] = true;
            dp[i][i+1] = 1 ;
        }
    }

    // Palindromes of length more then 2. This loop is similar
    // to Matrix Chain Multiplication. We start with a gap of
    // length 2 and fill DP table in a way that gap between
    // starting and ending indexes increases one by one by
    // outer loop.
    for (int gap=2 ; gap<n; gap++)
    {
        // Pick starting point for current gap
        for (int i=0; i<n-gap; i++)
        {
            int j = gap + i;

            if (str[i] == str[j] && P[i+1][j-1] )
                P[i][j] = true;

            if (P[i][j] == true)
                dp[i][j] = dp[i][j-1] + dp[i+1][j] + 1 - dp[i+1][j-1];
            else
                dp[i][j] = dp[i][j-1] + dp[i+1][j] - dp[i+1][j-1];
        }
    }

    // return total palindromic substrings
    return dp[0][n-1];
}

// Driver program
int main()
{
    string s,s1;
    cin>>s;
    int l,r,t;
    cin>>t;
    while(t-->0)
    {
        cin>>l>>r;
   s1=s.substr(l,r);

   cout << (CountPS(s1, r-l)+1) << endl;
    }
    return 0;
}