#include <bits/stdc++.h>
using namespace std;
bool isP[5002][5002];
int dp[5002][5002];
char str[5002];
void isPalin() {
  int len = strlen(str);
  for (int l = 0; l < len; l++) {
    for (int i = 0; i < len - l; i++) {
      int j = i + l;
      if (i == j)
        isP[i][i] = 1;
      else if (l == 1 && str[i] == str[j])
        isP[i][j] = 1;
      else if (l == 1 && str[i] != str[j])
        isP[i][j] = 0;
      else {
        if (str[i] == str[j] && isP[i + 1][j - 1] == 1)
          isP[i][j] = 1;
        else
          isP[i][j] = 0;
      }
    }
  }
}
void func() {
  int len = strlen(str);
  for (int l = 0; l < len; l++) {
    for (int i = 0; i < len - l; i++) {
      int j = i + l;
      if (i == j)
        dp[i][i] = 1;
      else if (l == 1 && str[i] == str[j])
        dp[i][j] = 3;
      else if (l == 1 && str[i] != str[j])
        dp[i][j] = 2;
      else {
        dp[i][j] = dp[i + 1][j] + dp[i][j - 1] - dp[i + 1][j - 1] +
                   (str[i] == str[j] && isP[i + 1][j - 1]);
      }
    }
  }
}
int main() {
  int n, i, j;
  scanf("%s", &str);
  scanf("%d", &n);
  isPalin();
  func();
  while (n--) {
    scanf("%d %d", &i, &j);
    cout << dp[i - 1][j - 1] << "\n";
  }
  return 0;
}
