#include <bits/stdc++.h>
#define MAX 100
#define MAX_CHAR 26
using namespace std;
 
// Precompute the prefix and suffix array.
void precompute(string s, int n, int l[][MAX], 
                                 int r[][MAX])
{
    l[s[0] - 'a'][0] = 1;
 
    // Precompute the prefix 2D array
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < MAX_CHAR; j++) 
            l[j][i] += l[j][i - 1];        
 
        l[s[i] - 'a'][i]++;
    }
 
    r[s[n - 1] - 'a'][n - 1] = 1;
 
    // Precompute the Suffix 2D array.
    for (int i = n - 2; i >= 0; i--) {
        for (int j = 0; j < MAX_CHAR; j++) 
            r[j][i] += r[j][i + 1];       
 
        r[s[i] - 'a'][i]++;
    }
}
 
// Find the number of palindromic subsequence of 
// length k
int countPalindromes(int k, int n, int l[][MAX], 
                                   int r[][MAX])
{
    int ans = 0;
 
    // If k is 1.
    if (k == 1) {
        for (int i = 0; i < MAX_CHAR; i++) 
            ans += l[i][n - 1];  
        return ans;
    }
 
    // If k is 2
    if (k == 2) {
 
        // Adding all the products of prefix array
        for (int i = 0; i < MAX_CHAR; i++)             
            ans += ((l[i][n - 1] * (l[i][n - 1] - 1)) / 2);
        return ans;
    }
 
    // For k greater than 2. Adding all the products
    // of value of prefix and suffix array.
    for (int i = 1; i < n - 1; i++) 
        for (int j = 0; j < MAX_CHAR; j++)             
            ans += l[j][i - 1] * r[j][i + 1];  
 
    return ans;
}
 
int main() {
    string s;
    cin >> s;
    
    int q;
    cin >> q;
    for(int a0 = 0; a0 < q; a0++){
        int l1;
        int r1;
        cin >> l1 >> r1;
        string s1 = "";
        for(int i=l1-1;i<r1-1;i++)
        {
            s1 += s[i];
        }
        int n = s1.length();
        int l[MAX_CHAR][MAX] = { 0 }, r[MAX_CHAR][MAX] = { 0 };
        precompute(s1, n, l, r);
        //cout << countPalindromes(k, n, l, r) << endl;
        int mx = INT_MIN;
        for(int k = 1;k<=n;k++)
        {
            int z = countPalindromes(k, n, l, r);
            if(mx < z) mx = z;
        }
        cout<<mx<<endl;
    }
    return 0;
}